IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v42y2013i4p931-946.html
   My bibliography  Save this article

Information elicitation and sequential mechanisms

Author

Listed:
  • Inbar Aricha
  • Rann Smorodinsky

Abstract

We study an incomplete information mechanism design problem with three peculiarities. First, access to agents’ private information is costly and unobservable. Second, the mechanism may communicate sequentially with the agents. Third, the mechanism designer and all the agents share a common interest. As an example one can think of N geologists that study the potential oil reserves in some tract. The geologists agree on the right course of action, given their N studies. However, carrying out the study may be costly for a geologist and so he may opt to fabricate a study. The oil company that employs these geologists need not contract them simultaneously and may, furthermore, choose to provide some of the results of early studies to geologists employed later on. Finally, the geologists and the oil company would like the joint study to forecast the quantity of oil reserves as accurate as possible. It turns out that, in such settings, what may not be implementable without communication becomes implementable with communication. Clearly, the possibility for sequential communication introduces a lot of complexity to the design problem. However, we provide a result in the spirit of the revelation principle and argue that whenever implementation is possible with communication it is also possible with a simple communication mechanism. Formally, we extend the model and results in Smorodinsky and Tennenholtz (Games Econ Behav 55(2):385–406, 2006 ) who consider the similar problem but restrict attention to symmetric social choice functions and IID distributions over the private information. Copyright Springer-Verlag 2013

Suggested Citation

  • Inbar Aricha & Rann Smorodinsky, 2013. "Information elicitation and sequential mechanisms," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 931-946, November.
  • Handle: RePEc:spr:jogath:v:42:y:2013:i:4:p:931-946
    DOI: 10.1007/s00182-012-0346-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-012-0346-6
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00182-012-0346-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Myerson, Roger B, 1983. "Mechanism Design by an Informed Principal," Econometrica, Econometric Society, vol. 51(6), pages 1767-1797, November.
    2. 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.
    3. Eddie Dekel & Michele Piccione, 2000. "Sequential Voting Procedures in Symmetric Binary Elections," Journal of Political Economy, University of Chicago Press, vol. 108(1), pages 34-55, February.
    4. Myerson, Roger B., 1982. "Optimal coordination mechanisms in generalized principal-agent problems," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 67-81, June.
    5. Battaglini, Marco, 2005. "Sequential voting with abstention," Games and Economic Behavior, Elsevier, vol. 51(2), pages 445-463, May.
    6. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    7. Nicola Persico, 2004. "Committee Design with Endogenous Information," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 71(1), pages 165-191.
    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. 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.
    2. 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.
    3. 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.
    4. Marinov, Eduard, 2008. "Нобеловата Награда За Икономика За Икономика 2007: Теорията За Икономическите Механизми [The Nobel Price for Economics 2007: The Design of Economic Institutions]," MPRA Paper 60294, University Library of Munich, Germany.
    5. Liu, Shuo, 2019. "Voting with public information," Games and Economic Behavior, Elsevier, vol. 113(C), pages 694-719.
    6. Nikandrova, Arina & Pancs, Romans, 2017. "Conjugate information disclosure in an auction with learning," Journal of Economic Theory, Elsevier, vol. 171(C), pages 174-212.
    7. Van Der Straeten, Karine & Yamashita, Takuro, 2023. "On the veil-of-ignorance principle: welfare-optimal information disclosure in Voting," TSE Working Papers 23-1463, Toulouse School of Economics (TSE).
    8. Rainer Schwabe, 2015. "Super Tuesday: campaign finance and the dynamics of sequential elections," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(4), pages 927-951, April.
    9. Gerardi, Dino & Yariv, Leeat, 2008. "Information acquisition in committees," Games and Economic Behavior, Elsevier, vol. 62(2), pages 436-459, March.
    10. Gersbach, Hans & Mamageishvili, Akaki & Tejada, Oriol, 2020. "Appointed Learning for the Common Good: Optimal Committee Size and Efficient Rewards," CEPR Discussion Papers 15311, C.E.P.R. Discussion Papers.
    11. Iaryczower, Matias, 2007. "Strategic voting in sequential committees," Working Papers 1275, California Institute of Technology, Division of the Humanities and Social Sciences.
    12. Gersbach, Hans & Mamageishvili, Akaki & Tejada, Oriol, 2022. "Appointed learning for the common good: Optimal committee size and monetary transfers," Games and Economic Behavior, Elsevier, vol. 136(C), pages 153-176.
    13. Myerson, Roger B., 1989. "Credible negotiation statements and coherent plans," Journal of Economic Theory, Elsevier, vol. 48(1), pages 264-303, June.
    14. Roger B. Myerson, 1988. "Mechanism Design," Discussion Papers 796, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    15. Pancs, Romans, 2013. "Sequential negotiations with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 82(C), pages 522-543.
    16. Roger B. Myerson, 1985. "Negotiation in Games: A Theoretical Overview," Discussion Papers 658, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Eddie Dekel Jr. & Michele Piccione Jr., 2014. "The Strategic Dis/advantage of Voting Early," American Economic Journal: Microeconomics, American Economic Association, vol. 6(4), pages 162-179, November.
    18. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    19. Larionov, Daniil & Pham, Hien & Yamashita, Takuro & Zhu, Shuguang, 2021. "First Best Implementation with Costly Information Acquisition," TSE Working Papers 21-1261, Toulouse School of Economics (TSE), revised Apr 2022.
    20. Skreta, Vasiliki & Koessler, Frédéric, 2021. "Information Design by an Informed Designer," CEPR Discussion Papers 15709, C.E.P.R. Discussion Papers.

    More about this item

    Keywords

    Mechanism design; Information elicitation; Sequential mechanism; Revelation principle; C72; D70; D82;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:spr:jogath:v:42:y:2013:i:4:p:931-946. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.