Single agents and the set of many-to-one stable matchings

DOI10.1006/jeth.1999.2586zbMath0955.91048MaRDI QIDQ1566906

Jordi Massó, Alejandro Neme, Ruth Martínez, Jorge A. Oviedo

Publication date: 4 March 2001

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jeth.1999.2586

zbMATH Keywords

\(q\)-separability; many-to-one stable matchings; responsive preference; substitutable preferences

Mathematics Subject Classification ID

91B08: Individual preferences

91B68: Matching models

Related Items

On the lattice structure of the set of stable matchings for a many-to-one model^∗, The blocking lemma and group incentive compatibility for matching with contracts, A many-to-many `rural hospital theorem', Implications of capacity reduction and entry in many-to-one stable matching, Probabilistic stable rules and Nash equilibrium in two-sided matching problems, The blocking lemma and strategy-proofness in many-to-many matchings, Decentralized job matching, The blocking lemma for a many-to-one matching model, Restabilizing matching markets at senior level, Smith and Rawls share a room: stability and medians, Monotonicity and Nash implementation in matching markets with contracts, Stable matchings and preferences of couples, Coalition formation games with separable preferences., Substitutes and stability for matching with contracts, Binary operations and lattice structure for a model of matching with contracts, Von Neumann-Morgenstern stable sets in matching problems, Credible group stability in many-to-many matching problems

Cites Work

• Unnamed Item
• Some remarks on the stable matching problem
• Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
• Ms. Machiavelli and the Stable Matching Problem
• The College Admissions Problem Revisited
• Job Matching, Coalition Formation, and Gross Substitutes
• College Admissions and the Stability of Marriage