Arbeitspapier

Maximal domain for strategy-proof rules in allotment economies

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 is qualified by an additional requirement that a domain should include a minimally rich domain. We first characterize the uniform rule (Bennasy, 1982) as the unique strategy-proof, symmetric, and efficient rule on a minimally rich domain when the amount of the good is fixed. Then, exploiting this characterization, we establish the following: There is a unique maximal domain that includes a minimally rich domain and allows for the existence of strategy-proof, symmetric, and efficient rules when the amount of good is a variable. It is the single-plateaued domain.

Language
Englisch

Bibliographic citation
Series: ISER Discussion Paper ; No. 628

Classification
Wirtschaft
Subject
Prinzipal-Agent-Theorie
Allokation

Event
Geistige Schöpfung
(who)
Mizobuchi, Hideyuki
Serizawa, Shigehiro
Event
Veröffentlichung
(who)
Osaka University, Institute of Social and Economic Research (ISER)
(where)
Osaka
(when)
2005

Handle
Last update
10.03.2025, 11:45 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Mizobuchi, Hideyuki
  • Serizawa, Shigehiro
  • Osaka University, Institute of Social and Economic Research (ISER)

Time of origin

  • 2005

Other Objects (12)