Stability and Efficiency of Partitions in Matching Problems

Theory and Decision 59 (3):193-205 (2005)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

`Sex-Equal' Stable Matchings.Antonio Romero-Medina - 2001 - Theory and Decision 50 (3):197-212.
Can economics rank slavery against free labor in terms of efficiency?Lawrence H. White - 2008 - Politics, Philosophy and Economics 7 (3):327-340.
Contextual emergence from physics to cognitive neuroscience.Harald Atmanspacher - 2007 - Journal of Consciousness Studies 14 (1-2):18-36.
On the existence of fair matching algorithms.F. Masarani & S. S. Gokturk - 1989 - Theory and Decision 26 (3):305-322.
Stability of matter.W. Thirring - 1990 - Foundations of Physics 20 (9):1103-1110.
Concept learning and probability matching.George Mandler, Philip A. Cowan & Cecile Gold - 1964 - Journal of Experimental Psychology 67 (6):514.

Analytics

Added to PP
2013-12-01

Downloads
35 (#443,848)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references