The division problem with maximal capacity constraints

Gustavo Bergantiños, Jordi Massó, Alejandro Neme

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Abstract

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. © 2011 The Author(s).
Original languageEnglish
Pages (from-to)29-57
JournalSERIEs
Volume3
DOIs
Publication statusPublished - 1 Jan 2012

Keywords

  • Capacity constraints
  • Division problem
  • Single-peaked preferences
  • Uniform rule

Cite this