Implementing egalitarian-equivalent allocation of indivisible goods on restricted domains
Shinji Ohseto ()
Economic Theory, 2004, vol. 23, issue 3, 659-670
Abstract:
We study the problem of allocating several units of homogeneous indivisible goods when monetary compensations are possible. First, we show that there is no strategy-proof, budget balanced, and egalitarian-equivalent mechanism even on extremely restricted preference domains. Next, we present two characterizations of strategy-proof and decision-efficient mechanisms that satisfy a stronger version of egalitarian-equivalence on preference domains bounded above. These characterizations tell us a trade-off between strategy-proofness and Pareto efficiency, and a relationship with strategy-proof and envy-free mechanisms. Finally, we prove that no egalitarian-equivalent mechanism is Nash implementable even on extremely restricted preference domains. Copyright Springer-Verlag Berlin/Heidelberg 2004
Keywords: Indivisible goods; Egalitarian-equivalence; Strategy-proofness; Nash implementation. (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (12)
Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-003-0369-0 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joecth:v:23:y:2004:i:3:p:659-670
Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2
DOI: 10.1007/s00199-003-0369-0
Access Statistics for this article
Economic Theory is currently edited by Nichoals Yanneils
More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().