CS252 Algorithms
Friday, 23 September 2022

+ Problem set #2
- 1(d) is tricky
- 2 -- definitions and algorithm are not too bad, but proving
    the algorithm gets you what you want is tougher; you'll
    need to engage with the G-S proof to see where it still
    holds up and where it doesn't
- Put some thinking time into it this weekend. We can talk
    further on Monday.

+ Questions?

+ Playing around with Gale-Shapley

- If all workers rank job j1 last and all jobs rank
   worker w1 last, will (j1, w1) end up in the matching?

- If there are more workers than jobs, how would you
   define the end goal of a matching process? Would the
   G-S algorithm get you there unchanged, or would it
   need modification?

- Same question, but if there are more jobs than workers.

- What if a person can exclude possible matches? What if somebody
only ranks a subset of the other side?

- What changes if there are multiple slots for a single job?

- Chisom's idea about letting children weigh in