We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

We generalize the canonical problem of Nash implementation by allowing agents to voluntarily provide discriminatory signals, i.e. evidence. Evidence can either take the form of hard information or, more generally, have differential but non-prohibitive costs in different states. In such...

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...

A group of actors, individuals or firms, can engage in collectively providing projects which may be costly or generating revenues and which may benefit some and harm others. Based on requirements of procedural fairness, we derive a bidding mechanism determining endogenously who participates in...

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...

The goal of this paper is to illustrate the significance of information acquisition in mechanism design. We provide a stark example of a mechanism design problem in a collective choice environment with information acquisition. We concentrate on committees that are comprised of agents sharing a...

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...

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)...

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.

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...