“Strategy-proofness” is one of the axioms that are most frequently used in the recent literature on social choice theory. It requires that by misrepresenting his preferences, no agent can manipulate the outcome of the social choice rule in his favor. The stronger requirement of “group...

We consider the problem of allocating an amount of a perfectly divisible good among a group of n agents. We study how large a preference domain can be to allow for the existence of strategy-proof, symmetric, and efficient allocation rules when the amount of the good is a variable. This question...

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model:(1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...

"Strategy-proofness" is one of the axioms that are most frequently used in the recent literature on social choice theory. It requires that by misrepresenting his preferences, no agent can manipulate the outcome of the social choice rule in his favor. The stronger requirement of "group...

We consider the problem of allocating an amount of a perfectly divisible good among a group of n agents. We study how large a preference domain can be to allow for the existence of strategy-proof, symmetric, and efficient allocation rules when the amount of the good is a variable. This question...

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...