Graphs and Marriages

DOI10.2307/3109805MaRDI QIDQ4222464zbMATH OpenOpenAlexFDO

Authors Guillaume Ratier, Michel Balinski

Publication date 31 May 1999

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3109805

zbMATH Keywords

marriage gamestable matching polytope

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(9)

• Student admissions and faculty recruitment
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• Bipartite choices
• Preference swaps for the stable matching problem
• The two-sided matching problem. Origin, development and current issues
• Deferred acceptance with compensation chains
• Equitable representation and recruitment
• Review of the theory of stable matchings and contract systems
• Stable matching games

This page was built for publication: Graphs and Marriages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222464)