Skip to main content
Log in

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

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: July 1999/Final version: April 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ohseto, S. Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains. Game Theory 29, 365–374 (2000). https://doi.org/10.1007/s001820000046

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001820000046