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
Revision as of 17:01, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:908186

DOI10.3934/JDG.2015009zbMath1391.91133OpenAlexW2527104209WikidataQ59973560 ScholiaQ59973560MaRDI QIDQ908186

Alvin E. Roth

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




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