Abstract
In the division problem with single-peaked preferences, an allocation rule is strategy-proof for same tops if no one can gain by reporting a false preference relation having the true peak. This new condition is so weak that it is implied by strategy-proofness and tops-only. We show that the uniform rule is the only rule satisfying this mild property under efficiency and envy-freeness. We then analyze how largely the preference domain can be extended with admitting a rule satisfying the three axioms, and show that the single-plateaued domain is the unique such maximal domain.
Original language | English |
---|---|
Pages (from-to) | 287-301 |
Number of pages | 15 |
Journal | Theory and Decision |
Volume | 72 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2012 Mar |
Keywords
- Strategy-proofness
- Strategy-proofness for same tops
- Tops-only
- Uniform rule
ASJC Scopus subject areas
- Decision Sciences(all)
- Developmental and Educational Psychology
- Arts and Humanities (miscellaneous)
- Applied Psychology
- Social Sciences(all)
- Economics, Econometrics and Finance(all)
- Computer Science Applications