Stability and Efficiency of Partitions in Matching Problems
We 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
When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:59:y:2005:i:3:p:193-205. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.