Hedonic games related to many-to-one matching problems
Social Choice and Welfare, 2012, vol. 39, issue 4, 737-749
We consider the existence problem of stable matchings in many-to-one matching problems. Unlike other approaches which use algorithmic techniques to give necessary and sufficient conditions, we adopt a game theoretic point of view. We first associate, with each many-to-one matching problem, a hedonic game to take advantage of recent results guaranteeing the existence of core-partitions for that class of games, to build up our conditions. The main result states that a many-to-one matching problem, with no restrictions on individual preferences, has stable* matchings if and only if a related hedonic game is pivotally balanced. In the case that the preferences in the matching problem are substitutable, the notions of stability and stability* coincide. Copyright Springer-Verlag 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:sochwe:v:39:y:2012:i:4:p:737-749
Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355
Access Statistics for this article
Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe
More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().