Balanced allocation methods for claims problems with indivisibilities

Herrero, Carmen;Martinez, Ricardo
(2006)

Files

dp2006_66.pdf
  • Open Access
  • Adobe PDF
  • 289.02 KB
Download

Details

Authors
  • Herrero, Carmen
    Author
  • Martinez, Ricardo
    Author
Abstract
We study claims problems in which a certain amount of indivisible units (of an homogeneous good) has to be distributed among a group of agents, when this amount is not enough to fully satisfy agents' demands. We are interested in finding solutions satisfying robustness and fairness properties. To do that, we define the M-down methods, which are the unique robust (composition down and consistency) and fair (balancedness or conditional full compensation ) rules. Besides, we also establish the relationships between these M-down methods and the constrained equal awards rule.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Herrero, C., & Martinez, R. (2006). Balanced allocation methods for claims problems with indivisibilities (CORE Discussion Papers 2006/66). https://hdl.handle.net/2078.5/128471