LAW February 20071 A 5/3 approximation algorithm for a hard case of stable marriage Rob Irving Computing Science Department University of Glasgow (joint.
Marriage, Honesty, & Stability N ICOLE I MMORLICA, N ORTHWESTERN U NIVERSITY.
School Choice 1. Today’s Class So far, have discussed different approaches to solving non-monetary allocation problems. Finding stable outcomes: DA algorithm.
Stabile Marriage Thanks to Mohammad Mahdian Lab for Computer Science, MIT.
Incentive compatibility in 2-sided matching markets Mohammad Mahdian Yahoo! Research Based on joint work with Nicole Immorlica.
Marriage, Honesty, & Stability
Random matching markets Itai Ashlagi. Stable Matchings = Core Allocations.
