deferred acceptance algorithm - Peter Cramton（递延接受算法Peter Cramton）.pdf

Stable Marriage Consider a set of n women and n men. Each person has an ordered list of some members of the opposite sex as his or her preference list . Let µ be a matching between women and men. A pair (m, w) is a blocking pair if both m and w prefer being together to their assignments under µ. Also, (x, x) is a blocking pair, if x prefers being single to his/her assignment under µ. A matching is stable if it does not have any blocking pair. Example Charlie Charlie Franklin Schroeder Linus Linus Linus Charlie Franklin Schroeder Franklin Lucy Peppermint Marcie Sally Charlie Linus Schroeder Franklin Lucy Marcie Marcie Peppermint Peppermint Sally Lucy Sally Marcie Stable! Marcie Deferred Acceptance Algorithms (Gale and Shapley, 1962) In each iteration, an unmarried man proposes to the first woman on his list that he hasn’t proposed to yet. A woman who receives a proposal that she prefers to her current assignment accepts it and rejects her current assignment. This is called the men-proposing algorithm. Example CharlieCharlie CharlieCharlieCharlie FranklinFranklin SchroederSchroederSchroeder LinusLinusLinus LinusLinus LinusLinus CharlieCharlieCharlie FranklinFranklinFranklin SchroederSchroeder FranklinFranklin Lucy Peppermint Marcie Sally Charlie