Von Neumann-Morgenstern stable sets in matching problems
The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characterization of (von Neumann-Morgenstern) stable sets in one-to-one matching problems. We show that a set of matchings is a stable set of a one-to-one matching problem only if it is a maximal set satisfying the following properties: (a) the core is a subset of the set; (b) the set is a lattice; and (c) the set of unmatched agents is identical for any two matchings belonging to the set. Furthermore, a set is a stable set if it is the unique maximal set satisfying properties (a), (b), and (c). We also show that our main result does not extend from one-to-one matching problems to many-to-one matching problems.
(This abstract was borrowed from another version of this item.)
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Martin J Osborne & Ariel Rubinstein, 2009.
"A Course in Game Theory,"
814577000000000225, UCLA Department of Economics.
- Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer;Game Theory Society, vol. 15(3), pages 187-200.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:134:y:2007:i:1:p:537-547. 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: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.