Stability and Efficiency of Partitions in Matching Problems
AbstractWe define two versions of stability and efficiency of partitions and analyze their relationships for some matching rules. The stability and efficiency of a partition depends on the matching rule Ï†. The results are stated under various membership property rights axioms. It is shown that in a world where agents can freely exit from and enter coalitions, whenever the matching rule is individually rational and Pareto optimal, the set of Ï†-stable and Ï†-efficient partitions coincide and it is unique: the grand coalition. Then we define a weaker version of stability and efficiency, namely specific to a given preference profile and find some negative results for stable matching rules. Copyright Springer 2005
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Theory and Decision.
Volume (Year): 59 (2005)
Issue (Month): 3 (November)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100341
matching; partitions; membership property rights; stability; efficiency;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Duygu Nizamogullari & İpek Özkal-Sanver, 2011. "Coalitional stability and efficiency of partitions in matching problems," Theory and Decision, Springer, vol. 71(3), pages 395-407, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.