Up methods in the allocation of indivisibilities when preferences are single-peaked

  1. Carmen Herrero 1
  2. Ricardo Martínez 2
  1. 1 Universidad de Alicante, España
  2. 2 Brown University, USA
Revista:
Top

ISSN: 1863-8279 1134-5764

Año de publicación: 2008

Volumen: 16

Número: 2

Páginas: 272-283

Tipo: Artículo

DOI: 10.1007/S11750-008-0043-6 DIALNET GOOGLE SCHOLAR lock_openAcceso abierto editor

Otras publicaciones en: Top

Objetivos de desarrollo sostenible

Resumen

We consider allocation problems with indivisible goods when agents’ preferences are single-peaked. We propose natural rules (called up methods) to solve such a class of problems and axiomatically characterize them. We also prove that these methods can be interpreted as extensions to the indivisible case of the so-called equal distance rule.