Bayesian implementation concerns decision making problems when agents have incomplete information. This paper proposes that the traditional sufficient conditions for Bayesian implementation shall be amended by virtue of a quantum Bayesian mechanism. Furthermore, by using an algorithmic Bayesian...

In the field of mechanism design, the revelation principle has been known for decades. Myerson, Mas-Colell, Whinston and Green gave formal proofs of the revelation principle. However, in this paper, we argue that there are serious bugs hidden in their proofs.

[Moore and Repullo, \emph{Econometrica} \textbf{58} (1990) 1083-1099] and [Dutta and Sen, \emph{Rev. Econom. Stud.} \textbf{58} (1991) 121-128] are two fundamental papers on two-agent Nash implementation. Both of them are based on Maskin's classic paper [Maskin, \emph{Rev. Econom. Stud.}...

This paper concerns what will happen if quantum mechanics is concerned in subgame perfect implementation. The main result is: When additional conditions are satisfied, the traditional characterization on subgame perfect implementation shall be amended by virtue of a quantum stage mechanism....

This study explores mechanism design with allocation-based social preferences. Agents' social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents' social preferences...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

This study explores mechanism design with allocation-based social preferences. Agents’ social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents’ social...

This paper considers games in which multiple principals contract simultaneously with the same agent. We introduce a new class of revelation mechanisms that, although it does not always permit a complete equilibrium characterization, it facilitates the characterization of the equilibrium outcomes...

In this paper we study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^{U}(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an...

This paper considers games in which multiple principals contract simultaneously with the same agent. We introduce a new class of revelation mechanisms that, although it does not always permit a complete equilibrium characterization, it facilitates the characterization of the equilibrium outcomes...