Ordinally Bayesian Incentive Compatible Stable Matching
We study incentive issues related to the two-sided one-to-one stable matching problem after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC). Under OBIC, truthtelling is required to maximize expected utility of every agent, expected utility being computed with respect to the agent's prior and under the assumption that everybody else is also telling the truth. We show that when preferences are unrestricted there exists no matching procedure that is both stable and OBIC. Next preferences are restricted to the case where remaining single is the worst alternative for every agent. We show that in this case, if agents have uniform priors the stable matching generated by the "deferred acceptance algorithms" are OBIC. However, for generic priors there are no procedures that are both stable and OBIC even with restricted preferences.
|Date of creation:||2003|
|Date of revision:|
|Note:||View the original document on HAL open archive server: https://hal.archives-ouvertes.fr/hal-00242988|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|
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.:
- 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).
- Alcalde, Jose & Barbera, Salvador, 1994. "Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems," Economic Theory, Springer, vol. 4(3), pages 417-35, May.
- Dipjyoti Majumdar & Arunava Sen, 2003. "Ordinally Bayesian incentive-compatible voting schemes," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 03-01, Indian Statistical Institute, New Delhi, India.
- Ehlers, Lars, 2004. "In search of advice for participants in matching markets which use the deferred-acceptance algorithm," Games and Economic Behavior, Elsevier, vol. 48(2), pages 249-270, August.
- Roth, Alvin E., 1989. "Two-sided matching with incomplete information about others' preferences," Games and Economic Behavior, Elsevier, vol. 1(2), pages 191-209, June.
- Alvin E. Roth & Elliott Peranson, 1999.
"The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design,"
NBER Working Papers
6963, National Bureau of Economic Research, Inc.
- Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
- Harsanyi, John C., 1994.
"Games with Incomplete Information,"
Nobel Prize in Economics documents
1994-1, Nobel Prize Committee.
- Roth, Alvin E & Vande Vate, John H, 1991. "Incentives in Two-Sided Matching with Random Stable Mechanisms," Economic Theory, Springer, vol. 1(1), pages 31-44, January.
- d'ASPREMONT, Claude & PELEG,Â Bezalel, .
"Ordinal Bayesian incentive compatible representations of committees,"
CORE Discussion Papers RP
808, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- dâ€™ASPREMONT, C. & PELEG, B., 1986. "Ordinal Bayesian incentive compatible representations of committees," CORE Discussion Papers 1986042, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:hal:wpaper:hal-00242988. 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: (CCSD)
If references are entirely missing, you can add them using this form.