Mechanism design with partial state verifiability

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.