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.
MLA
Ben‐Porath, Elchanan, et al. “Mechanisms with Evidence: Commitment and Robustness.” Econometrica, vol. 87, .no 2, Econometric Society, 2019, pp. 529-566, https://doi.org/10.3982/ECTA14991
Chicago
Ben‐Porath, Elchanan, Eddie Dekel, and Barton L. Lipman. “Mechanisms with Evidence: Commitment and Robustness.” Econometrica, 87, .no 2, (Econometric Society: 2019), 529-566. https://doi.org/10.3982/ECTA14991
APA
Ben‐Porath, E., Dekel, E., & Lipman, B. L. (2019). Mechanisms with Evidence: Commitment and Robustness. Econometrica, 87(2), 529-566. https://doi.org/10.3982/ECTA14991
The Executive Committee of the Econometric Society has approved an increase in the submission fees for papers in Econometrica. Starting January 1, 2025, the fee for new submissions to Econometrica will be US$125 for regular members and US$50 for student members.
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.