Additive rules in discrete allocation problems

DOI10.1016/j.ejor.2004.11.015zbMath1111.90063OpenAlexW2078473107MaRDI QIDQ2488918

Gustavo Bergantiños, Juan J. Vidal-Puga

Publication date: 16 May 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.11.015

zbMATH Keywords

Game theoryAllocation problems

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Discrete location and assignment (90B80)

Related Items (6)

Endowment additivity and the weighted proportional rules for adjudicating conflicting claims ⋮ Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case ⋮ Compensation and sacrifice in the probabilistic rationing of indivisible units ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Aggregator operators for dynamic rationing ⋮ Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update

Cites Work

• Game theoretic analysis of a bankruptcy problem from the Talmud
• Equal or proportional division of a surplus, and other methods
• Distributive justice in taxation
• The proportional solution for rights problems
• A problem of rights arbitration from the Talmud
• Individual rights and collective responsibility: The rights-egalitarian solution
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• Additive rules in bankruptcy problems and other related problems.
• The proportional random allocation of indivisible units
• On Dividing an Amount According to Individual Claims or Liabilities
• Priority Rules and Other Asymmetric Rationing Methods
• Fair Queuing and Other Probabilistic Allocation Methods

This page was built for publication: Additive rules in discrete allocation problems