IDEAS home Printed from https://ideas.repec.org/p/mpg/wpaper/2010_46.html
   My bibliography  Save this paper

Matching Allocation Problems with Endogenous Information Acquisition

Author

Listed:
  • Sophie Bade

    (Max Planck Institute for Research on Collective Goods, Bonn)

Abstract

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.

Suggested Citation

  • Sophie Bade, 2010. "Matching Allocation Problems with Endogenous Information Acquisition," Discussion Paper Series of the Max Planck Institute for Research on Collective Goods 2010_46, Max Planck Institute for Research on Collective Goods.
    • Handle: RePEc:mpg:wpaper:2010_46
    as

    Download full text from publisher

    File URL: http://www.coll.mpg.de/pdf_dat/2010_46online.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. 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.
    3. Grossman, Sanford J & Stiglitz, Joseph E, 1980. "On the Impossibility of Informationally Efficient Markets," American Economic Review, American Economic Association, vol. 70(3), pages 393-408, June.
    4. Olivier Compte & Philippe Jehiel, 2007. "Auctions and information acquisition: sealed bid or dynamic formats?," RAND Journal of Economics, RAND Corporation, vol. 38(2), pages 355-372, June.
    5. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    6. Dirk Bergemann & Juuso Valimaki, 2005. "Information in Mechanism Design," Cowles Foundation Discussion Papers 1532R, Cowles Foundation for Research in Economics, Yale University, revised Jan 2006.
    7. Verrecchia, Robert E, 1982. "Information Acquisition in a Noisy Rational Expectations Economy," Econometrica, Econometric Society, vol. 50(6), pages 1415-1430, November.
    8. 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)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bade, Sophie, 2011. "Matching Allocation Problems with Endogenous Information Acquisition," VfS Annual Conference 2011 (Frankfurt, Main): The Order of the World Economy - Lessons from the Crisis 48735, Verein für Socialpolitik / German Economic Association.
    2. ,, 2015. "Serial dictatorship: the unique optimal allocation rule when information is endogenous," Theoretical Economics, Econometric Society, vol. 10(2), May.
    3. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    4. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    5. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    6. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    7. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    8. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    9. Morimitsu Kurino, 2014. "House Allocation with Overlapping Generations," American Economic Journal: Microeconomics, American Economic Association, vol. 6(1), pages 258-289, February.
    10. Patrick Harless & William Phan, 2020. "On endowments and indivisibility: partial ownership in the Shapley–Scarf model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 411-435, September.
    11. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    12. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    13. Ergin, Haluk I., 2000. "Consistency in house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 34(1), pages 77-97, August.
    14. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    15. Ehlers, Lars & Klaus, Bettina & Papai, Szilvia, 2002. "Strategy-proofness and population-monotonicity for house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 38(3), pages 329-339, November.
    16. Miyagawa, Eiichi, 2001. "House Allocation with Transfers," Journal of Economic Theory, Elsevier, vol. 100(2), pages 329-355, October.
    17. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    18. Marek Bojko, 2020. "The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas," Papers 2012.11028, arXiv.org.
    19. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    20. Christian Basteck, 2024. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.

    More about this item

    Keywords

    Bubbles; Rational Expectations; Bonuses; Compensation Schemes; Financial Crises; Financial Policy;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mpg:wpaper:2010_46. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Marc Martin (email available below). General contact details of provider: https://edirc.repec.org/data/mppggde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.