This book probes the stable marriage problem and its variants as a rich source ofproblems and ideas that illustrate both the design and analysis of efficient algorithms. It coversthe most recent structural and algorithmic work on stable matching problems, simplifies and unifiesmany earlier proofs, strengthens several earlier results, and presents new results and moreefficient algorithms.The authors develop the structure of the set of stable matchings...