Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor
From MaRDI portal
Publication:908186
DOI10.3934/jdg.2015009zbMath1391.91133OpenAlexW2527104209WikidataQ59973560 ScholiaQ59973560MaRDI QIDQ908186
Publication date: 3 February 2016
Published in: Journal of Dynamics and Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jdg.2015009
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal truncation in matching markets
- Incentive compatibility in a market with indivisible goods
- Misrepresentation and stability in the marriage problem
- The college admissions problem is not equivalent to the marriage problem
- Some remarks on the stable matching problem
- A further note on the stable matching problem
- Interior points in the core of two-sided matching markets
- Cores of partitioning games
- Core many-to-one matchings by fixed-point methods
- A nonconstructive elementary proof of the existence of stable marriages
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
- Existence of stable outcomes and the lattice property for a unified matching market
- On a characterization of stable matchings
- Matching of like rank and the size of the core in the marriage problem
- The assignment game. I: The core
- An elementary non-constructive proof of the non-emptiness of the core of the housing market of Shapley and Scarf
- Stability in Large Matching Markets with Complementarities
- Assignment Problems and the Location of Economic Activities
- The Strategy Structure of Two-Sided Matching Markets
- Ms. Machiavelli and the Stable Matching Problem
- The College Admissions Problem Revisited
- Machiavelli and the Gale-Shapley Algorithm
- The Economics of Matching: Stability and Incentives
- Job Matching, Coalition Formation, and Gross Substitutes
- The Dynamics of Reorganization in Matching Markets: A Laboratory Experiment Motivated by A Natural Experiments*
- Stable marriage assignment for unequal sets
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Stable husbands
- College Admissions and the Stability of Marriage
This page was built for publication: Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor