Matching Allocation Problems with Endogenous Information Acquisition
The paper introduces the assumption of costly information acquisition to the theory of mechanism design for matching allocation problems. It is shown that the assumption of endogenous information acquisition greatly changes some of the cherished results in that theory: in particular, the first-best might not be implementable. Moreover, it might not even be possible to implement the second-best through trade. In addition, the paper highlights the use of randomness in setting incentives for efficient learning. The trade-offs among simultaneous and sequential learning and among efficient learning and efficient allocations are discussed.
|Date of creation:||2011|
|Contact details of provider:|| Web page: http://www.socialpolitik.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.:
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- Gershkov, Alex & Szentes, Balázs, 2009.
"Optimal voting schemes with costly information acquisition,"
Journal of Economic Theory,
Elsevier, vol. 144(1), pages 36-68, January.
- Alex Gershkov & Balazs Szentes, 2004. "Optimal Voting Schemes with Costly Information Acquisition," NajEcon Working Paper Reviews 122247000000000311, www.najecon.org.
- Verrecchia, Robert E, 1982. "Information Acquisition in a Noisy Rational Expectations Economy," Econometrica, Econometric Society, vol. 50(6), pages 1415-1430, November.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
- Myerson, Roger B., 1982. "Optimal coordination mechanisms in generalized principal-agent problems," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 67-81, June.
- Smorodinsky, Rann & Tennenholtz, Moshe, 2006. "Overcoming free riding in multi-party computations--The anonymous case," Games and Economic Behavior, Elsevier, vol. 55(2), pages 385-406, May. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:zbw:vfsc11:48735. 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: (ZBW - German National Library of Economics)
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.