Quantum strategies have been successfully applied in game theory for years. However, as a reverse problem of game theory, the theory of mechanism design is ignored by physicists. In this paper, we generalize the classical theory of mechanism design to a quantum domain and obtain two results: 1)...

[E. Maskin, \emph{Rev. Econom. Stud.} \textbf{66} (1999) 23-38] is a seminal paper in the field of mechanism design and implementation theory. [J. Moore and R. Repullo, \emph{Econometrica} \textbf{58} (1990) 1083-1099] and [B. Dutta and A. Sen, \emph{Rev. Econom. Stud.} \textbf{58} (1991)...

A jury has to choose the winner of a contest. There exists a deserving winner, whose identity is common knowledge among the jurors, but not known by the planner. Jurors may be biased in favor (friend) or against (enemy) some contestants. We study conditions on the confi?guration of the jury so...

We analyze the problem of choosing the w contestants who will win a competition within a group of nw competitors when all jurors commonly observe who are the w best contestants but may be biased. We study conditions on the configuration of the jury so that it is possible to induce the jurors to...

For groups that must make several decisions of similar form, we define a simple and general mechanism that is designed to promote social efficiency. The mechanism links the various decisions by forcing agents to budget their representations of preferences so that the frequency of preferences...

We analyze the problem of choosing the w contestants who will win a competition within a group of n w competitors when all jurors commonly observe who the w best contestants are, but they may be biased. We study conditions on the configuration of the jury so that it is possible to induce the...

We analyze the problem of a jury choosing the winner from a set of agents when the identity of the deserving winner is common knowledge amongst the jurors but each juror is biased in favor of one di¤erent agent. We propose a simple and natural mechanism that implements the socially optimal rule...

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.

We characterize the outcomes of games when players may make binding offers of strategy contingent side payments before the game is played. This does not always lead to efficient outcomes, despite complete information and costless contracting. The characterizations are illustrated in a series of...

Every agent reports his willingness to pay for one unit of good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...