The Eeckhout Condition and the Subgame Perfect Implementation of Stable Matching
We investigate an extensive form sequential matching game of perfect information. We show that the subgame perfect equilibrium of the sequential matching game leads to the unique stable matching when the Eeckhout Condition (2000) for existence of a unique stable matching holds, regardless of the sequence of agents. This result does not extend to preferences that violate the Eeckhout Condition, even if there is a unique stable matching.
|Date of creation:||03 Dec 2006|
|Contact details of provider:|| Postal: Society for Economic Dynamics Marina Azzimonti Department of Economics Stonybrook University 10 Nicolls Road Stonybrook NY 11790 USA|
Web page: http://www.EconomicDynamics.org/
More information through EDIRC
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.:
- Shin, Sungwhee & Suh, Sang-Chul, 1996. "A mechanism implementing the stable rule in marriage problems," Economics Letters, Elsevier, vol. 51(2), pages 185-189, May.
- Clark Simon, 2006. "The Uniqueness of Stable Matchings," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 6(1), pages 1-28, December.
- Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, January.
- Eeckhout, Jan, 2000. "On the uniqueness of stable marriage matchings," Economics Letters, Elsevier, vol. 69(1), pages 1-8, October.
When requesting a correction, please mention this item's handle: RePEc:red:sed006:176. 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: (Christian Zimmermann)
If references are entirely missing, you can add them using this form.