Balanced allocation methods for claims problems with indivisibilities

DOI10.1007/S00355-007-0262-ZzbMath1135.91370OpenAlexW2132829878MaRDI QIDQ927416

Ricardo Martínez, Carmen Herrero

Publication date: 6 June 2008

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00355-007-0262-z

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (9)

Bankruptcy problems with non-integer claims: definition and characterizations of the ICEA solution ⋮ Integer solutions to bankruptcy problems with non-integer claims ⋮ Compensation and sacrifice in the probabilistic rationing of indivisible units ⋮ Priority classes and weighted constrained equal awards rules for the claims problem ⋮ Remarks on the integer Talmud solution for integer bankruptcy problems ⋮ Up methods in the allocation of indivisibilities when preferences are single-peaked ⋮ Nontransferable utility bankruptcy games ⋮ Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update ⋮ Systematic favorability in claims problems with indivisibilities

Cites Work

• Consistency and its converse: an introduction
• Protective properties and the constrained equal awards rule for claims problems: A note
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• The three musketeers: four classical solutions to bankruptcy problems.
• Sustainability in bankruptcy problems.
• Equivalence of axioms for bankruptcy problems
• On Huntington Methods of Apportionment
• Priority Rules and Other Asymmetric Rationing Methods
• Fair Queuing and Other Probabilistic Allocation Methods

This page was built for publication: Balanced allocation methods for claims problems with indivisibilities