An algorithm for the min-max loss rule for claims problems

DOI10.1007/BF03398513zbMath0904.90175MaRDI QIDQ1393010

Somdeb Lahiri

Publication date: 1997

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

bankruptcy problemclaims problemminimizing the maximum loss

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Cooperative games (91A12) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Axiomatic characterizations of the CEA solution for rationing problems

Cites Work

• Game theoretic analysis of a bankruptcy problem from the Talmud
• The separability axiom and equal-sharing methods
• Distributive justice in taxation
• A problem of rights arbitration from the Talmud
• The bankruptcy problem: A cooperative bargaining approach
• New characterizations of old bankruptcy rules
• On Dividing an Amount According to Individual Claims or Liabilities
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for the min-max loss rule for claims problems