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|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.EconomicDynamics.org/society.htm
More information through EDIRC
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.:
- Clark Simon, 2006. "The Uniqueness of Stable Matchings," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 6(1), pages 1-28, December.
- Sonmez, Tayfun, 1997. "Games of Manipulation in Marriage Problems," Games and Economic Behavior, Elsevier, vol. 20(2), pages 169-176, August.
- Martin J Osborne & Ariel Rubinstein, 2009.
"A Course in Game Theory,"
814577000000000225, UCLA Department of Economics.
- Kara, Tarik & Sonmez, Tayfun, 1996. "Nash Implementation of Matching Rules," Journal of Economic Theory, Elsevier, vol. 68(2), pages 425-439, February.
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.