Approximate Bayesian Implementation and Exact Maxmin Implementation: An Equivalence

62 Pages Posted: 20 Aug 2019 Last revised: 17 Oct 2022

See all articles by Yangwei Song

Yangwei Song

University of Colorado at Boulder

Date Written: October 17, 2022

Abstract

This paper provides a micro-foundation for approximate incentive compatibility using ambiguity aversion. In particular, we propose a novel notion of approximate interim incentive compatibility, approximate local incentive compatibility, and establish an equivalence between approximate local incentive compatibility in a Bayesian environment and exact interim incentive compatibility in the presence of a small degree of ambiguity. We then apply our result to the implementation of efficient allocations. In particular, we identify three economic settings---including ones in which approximately efficient allocations are implementable, ones in which agents are informationally small, and large double auctions---in which efficient allocations are approximately locally implementable when agents are Bayesian. Applying our result to those settings, we conclude that efficient allocations are exactly implementable when agents perceive a small degree of ambiguity.

Keywords: approximate local incentive compatibility, ambiguity aversion, efficiency, informational size, modified VCG mechanism, double auction.

JEL Classification: D61, D82

Suggested Citation

Song, Yangwei, Approximate Bayesian Implementation and Exact Maxmin Implementation: An Equivalence (October 17, 2022). Available at SSRN: https://ssrn.com/abstract=3438731 or http://dx.doi.org/10.2139/ssrn.3438731

Yangwei Song (Contact Author)

University of Colorado at Boulder ( email )

CO

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
119
Abstract Views
933
Rank
600,462
PlumX Metrics