Artículo
The division problem with maximal capacity constraints
Fecha de publicación:
06/2012
Editorial:
Springer
Revista:
Series
ISSN:
1869-4187
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
The division problem consists of allocating a given amount of an homogeneous and perfectly divisible good among a group of agents with single-peaked preferences on the set of their potential shares. A rule proposes a vector of shares for each division problem. Most of the literature has implicitly assumed that all divisions are feasible. In this paper we consider the division problem when each agent has a maximal capacity due to an objective and verifiable feasibility constraint which imposes an upper bound on his share. Then each agent has a feasible interval of shares where his preferences are single-peaked. A rule has to propose to each agent a feasible share. We focus mainly on strategy-proof, efficient and consistent rules and provide alternative characterizations of the extension of the uniform rule that deals explicitly with agents' maximal capacity constraints.
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(IMASL)
Articulos de INST. DE MATEMATICA APLICADA DE SAN LUIS
Articulos de INST. DE MATEMATICA APLICADA DE SAN LUIS
Citación
Bergantiños, Gustavo; Jordi, Massó Carreras; Neme, Alejandro José; The division problem with maximal capacity constraints; Springer; Series; 3; 1-2; 6-2012; 29-57
Compartir
Altmétricas