z-logo
Premium
Mechanisms With Evidence: Commitment and Robustness
Author(s) -
BenPorath Elchanan,
Dekel Eddie,
Lipman Barton L.
Publication year - 2019
Publication title -
econometrica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 16.7
H-Index - 199
eISSN - 1468-0262
pISSN - 0012-9682
DOI - 10.3982/ecta14991
Subject(s) - incentive compatibility , mechanism design , robustness (evolution) , mathematical economics , stochastic game , incentive , microeconomics , principal–agent problem , equilibrium selection , strategic dominance , economics , principal (computer security) , compatibility (geochemistry) , computer science , mathematical optimization , game theory , repeated game , mathematics , engineering , chemical engineering , corporate governance , biochemistry , chemistry , finance , gene , operating system
We show that in a class of I ‐agent mechanism design problems with evidence, commitment is unnecessary, randomization has no value, and robust incentive compatibility has no cost. In particular, for each agent i , we construct a simple disclosure game between the principal and agent i where the equilibrium strategies of the agents in these disclosure games give their equilibrium strategies in the game corresponding to the mechanism but where the principal is not committed to his response. In this equilibrium, the principal obtains the same payoff as in the optimal mechanism with commitment. As an application, we show that certain costly verification models can be characterized using equilibrium analysis of an associated model of evidence.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom