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 study mechanisms for environments in which only some of the agents are directly connected to a mechanism designer and the other agents can participate in a mechanism only through the connected agents' referrals. In such environments, the mechanism designer and agents may have different...

In the standard auction model, we provide a necessary and sufficient condition on the value domain under which non-trivial mechanisms exist that satisfy group strategy-proofness and symmetry. In particular, this condition is satisfied (violated) if values are drawn from a finite set (an interval)

A competition authority has an objective, which specifies what output profile firms need to produce as a function of production costs. These costs change over time and are only known by the firms. The objective is implementable if inequilibrium, the firms cannot collude on their reports to the...

In this paper we deal with situations of collective contests between two groups over a private prize. A well known way to divide the prize within the winning group is the prize sharing rule introduced by Nitzan, 1991. Since its introduction it has become a standard in the collective contests...

We study mechanisms for environments in which only some of the agents are directly connected to a mechanism designer and the other agents can participate in a mechanism only through the connected agents' referrals. In such environments, the mechanism designer and agents may have different...

The planner wants to give k identical, indivisible objects to the top k valuation agents at zero costs. Each agent knows her own valuation of the object and whether it is among the top k. Modify the (k 1)st-price sealed-bid auction by introducing a small participation fee and the option not to...

Consider the problem of allocating k identical, indivisible objects among n agents, where k is less than n. The planner's objective is to give the objects to the top k valuation agents at zero costs to the planner and the agents. Each agent knows the identity of those k agents, as well as her...

Unanimous voting as the fundamental procedural source of political legitimacy grants veto power to each individual. We present an axiomatic characterization of a class of bidding processes to spell out the underlying egalitarian values for collective projects of a "productive state". At heart of...