Incentive-Compatible Matching Mechanisms: Consistency with Various Stability Notions
I study the consistency of incentive compatibility with several stability notions for a one-to-one matching market with transfers. Ex post stability, studied in the matching literature, is too strong to be satisfied together with incentive compatibility. Therefore, I introduce weaker stability notions: ex ante stability and interim stability. Although ex ante stability is consistent with incentive compatibility when agents are ex ante identical or when the market is balanced, interim stability can only be satisfied when there is one agent on the short side of the market, as in auctions. Which stability is appropriate depends on when agents can block.
Volume (Year): 5 (2013)
Issue (Month): 4 (November)
|Contact details of provider:|| Web page: https://www.aeaweb.org/aej-microEmail: |
More information through EDIRC
|Order Information:||Web: https://www.aeaweb.org/subscribe.html|
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.:
- Roth, Alvin, 2008.
"Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions,"
2579651, Harvard University Department of Economics.
- Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer, vol. 36(3), pages 537-569, March.
- Alvin E Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Levine's Bibliography 843644000000000283, UCLA Department of Economics.
- Alvin E. Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," NBER Working Papers 13225, National Bureau of Economic Research, Inc.
- Alcalde, Jose & Barbera, Salvador, 1994.
"Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems,"
Springer, vol. 4(3), pages 417-35, May.
- Alcalde, J. & Barberà, S., 1992. "Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems," UFAE and IAE Working Papers 196.92, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- M. Bumin Yenmez, 2009. "Incentive Compatible Market Design with Applications," GSIA Working Papers 2013-E21, Carnegie Mellon University, Tepper School of Business.
- Forges, Francoise, 2004.
"The ex ante incentive compatible core of the assignment game,"
Mathematical Social Sciences,
Elsevier, vol. 47(2), pages 135-151, March.
- F. Forges, 2002. "The Ex Ante Incentive Compatible Core of the Assignment Game," THEMA Working Papers 2002-07, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Forges, Françoise, 2004. "The ex ante incentive compatible core of the assignement game," Economics Papers from University Paris Dauphine 123456789/169, Paris Dauphine University.
- Jean-Jacques Laffont & David Martimort, 2000.
"Mechanism Design with Collusion and Correlation,"
Econometric Society, vol. 68(2), pages 309-342, March.
- Roger B. Myerson & Mark A. Satterthwaite, 1981.
"Efficient Mechanisms for Bilateral Trading,"
469S, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Tayfun Sönmez & M. Utku Ünver, 2009. "Matching, Allocation, and Exchange of Discrete Resources," Boston College Working Papers in Economics 717, Boston College Department of Economics.
- John H. Kagel & Alvin E. Roth, 2000. "The Dynamics Of Reorganization In Matching Markets: A Laboratory Experiment Motivated By A Natural Experiment," The Quarterly Journal of Economics, MIT Press, vol. 115(1), pages 201-235, February.
- Dipjyoti Majumdar, 2003.
"Ordinally Bayesian Incentive Compatible Stable Matching,"
- Dipjyoti Majumdar, 2003. "Ordinally Bayesian Incentive Compatible Stable Matchings," Working Papers 05001, Concordia University, Department of Economics.
- Ehlers, Lars & Masso, Jordi, 2007. "Incomplete information and singleton cores in matching markets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 587-600, September.
- Pavlov, Gregory, 2008. "Auction design in the presence of collusion," Theoretical Economics, Econometric Society, vol. 3(3), September.
- Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer, vol. 36(3), pages 393-407, March.
- Myerson, Roger B., 2007.
"Virtual utility and the core for games with incomplete information,"
Journal of Economic Theory,
Elsevier, vol. 136(1), pages 260-285, September.
- Roger Myerson, 2004. "Virtual utility and the core for games with incomplete information," Econometric Society 2004 North American Summer Meetings 659, Econometric Society.
- Chakraborty, Archishman & Citanna, Alessandro & Ostrovsky, Michael, 2010. "Two-sided matching with interdependent values," Journal of Economic Theory, Elsevier, vol. 145(1), pages 85-105, January.
When requesting a correction, please mention this item's handle: RePEc:aea:aejmic:v:5:y:2013:i:4:p:120-41. 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: (Jane Voros)or (Michael P. Albert)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.