Games of Capacity Manipulation in Hospital-intern Markets
In this paper, we analyze capacity manipulation games in hospital-intern markets inspired by the real-life entry-level labor markets for young physicians seeking residencies at hospitals. In these markets, where the matching is determined by a centralized clearinghouse called the National Residency Matching Program (NRMP) in the USA, hospitals usually report the number of vacant positions to the NRMP as well as their preferences. We consider a model where preferences of hospitals and interns are common knowledge, and hospitals play a game of reporting their capacities. We characterize the equilibria of the game-form for the two most widely used stable rules: hospital-optimal and intern-optimal stable rules. We show that (i) there may not be a pure strategy equilibrium in general; and (ii) when a pure strategy equilibrium exists other than true-capacities, truthful capacity revelation is weakly Pareto-dominated for hospitals. We also analyze other properties of the set of Nash equilibria. Finally, we present sufficient conditions on preferences to guarantee the existence of pure strategy equilibria.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 27 (2006)
Issue (Month): 1 (August)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- Tayfun Sönmez, 1994.
"Strategy-proofness in many-to-one matching problems,"
Review of Economic Design,
Springer, vol. 1(1), pages 365-380, December.
- Sonmez, T., 1995. "Strategy-Proofness in Many-To-One Matching Problems," Papers 95-01, Michigan - Center for Research on Economic & Social Theory.
- 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.
- Roth, Alvin E & Sotomayor, Marilda, 1989. "The College Admissions Problem Revisited," Econometrica, Econometric Society, vol. 57(3), pages 559-70, May.
- Tayfun Sönmez & Tarik Kara, 1997. "Implementation of college admission rules (*)," Economic Theory, Springer, vol. 9(2), pages 197-218.
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-80, November.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001.
"Core in a simple coalition formation game,"
Social Choice and Welfare,
Springer, vol. 18(1), pages 135-153.
- Sertel, Murat R., 1994. "Manipulating Lindahl equilibrium via endowments," Economics Letters, Elsevier, vol. 46(2), pages 167-171, October.
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:27:y:2006:i:1:p:3-24. 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: (Sonal Shukla)or (Christopher F Baum)
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.