Mechanism design with partial state verifiability

Raymond Deneckere and Sergei Severinov

Games and Economic Behavior, 2008, vol. 64, issue 2, 487-513

Abstract: We study implementation in environments where agents have limited ability to imitate others. Agents are randomly and privately endowed with type-dependent sets of messages. So sending a message becomes a partial proof regarding type. For environments where agents can send any combination of available messages, we develop an Extended Revelation Principle and characterize the incentive constraints which implementable allocations must satisfy. When not all message combinations are feasible, static mechanisms no longer suffice. If a 'punishment' allocation exists for each agent, then implementable allocations can be characterized as equilibria of a "Revelation Game," in which agents first select from the menus of allocation rules, then the mediator requests each agent to send some verifying messages. When a punishment allocation fails to exist for some agent, dynamic games in which agents gradually reveal their evidence implement a larger set of outcomes. The latter result provides a foundation for a theory of debate.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (49)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899-8256(08)00036-5
Full text for ScienceDirect subscribers only

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:eee:gamebe:v:64:y:2008:i:2:p:487-513

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().