EconPapers    
Economics at your fingertips  
 

Unique Information Elicitation

Hitoshi Matsushima and Shunya Noda

No CARF-F-496, CARF F-Series from Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo

Abstract: This study investigates the unique information elicitation problem. A central planner attempts to elicit correct information from multiple informed agents through mutual monitoring. There is a severe restriction on incentive devices: we assume neither public monitoring technology nor allocation rule is available; thus, the central planner only uses monetary payment rules. It is well-known that if all agents are selfish, it is impossible to elicit information as a unique equilibrium. We consider an epistemological possibility that some agents could be motivated by an intrinsic preference for honesty, while we allow that honest agents are mostly motivated by monetary interest. We prove that, once we introduce an epistemic type space that allows agents to be (weakly) honest, then the impossibility theorem reduces to a knife-edge case: The central planner can elicit correct information from agents as a unique Bayes Nash equilibrium behavior if and only if it is never common knowledge that all agents are selfish.

Pages: 29
Date: 2020-10
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.carf.e.u-tokyo.ac.jp/admin/wp-content/uploads/2020/10/F496.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cfi:fseres:cf496

Access Statistics for this paper

More papers in CARF F-Series from Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo Contact information at EDIRC.
Bibliographic data for series maintained by ().

 
Page updated 2025-04-03
Handle: RePEc:cfi:fseres:cf496