Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains

Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains

0.00 Avg rating0 Votes
Article ID: iaor20013510
Country: Germany
Volume: 29
Issue: 3
Start Page Number: 365
End Page Number: 374
Publication Date: Jan 2000
Journal: International Journal of Game Theory
Authors:
Abstract:

We consider allocation mechanisms in economies with a single indivisible good and money. First, we show that there is no strategy-proof and Pareto efficient mechanism on some preference domains which consist of a sufficiently large but finite number of quasi-linear preferences. Second, we show that there is no strategy-proof, Pareto efficient, and equally compensatory mechanism on arbitrary preference domains which consist of more than three quasi-linear preferences.

Reviews

Required fields are marked *. Your email address will not be published.