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

DOI10.1007/BF03398513MaRDI QIDQ1393010zbMATH OpenFDO

Authors Somdeb Lahiri

Publication date 1997

Published in Opsearch (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11718/2022

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)

Recommendations

• The constrained equal loss rule in problems with constraints and claims
• Additive adjudication of conflicting claims
• For claims problems, another compromise between the proportional and constrained equal awards rules
• Claim problems with coalition demands
• A new solution to the problem of adjudicating conflicting claims

Cites work

• A problem of rights arbitration from the Talmud
• Distributive justice in taxation
• Game theoretic analysis of a bankruptcy problem from the Talmud
• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• scientific article; zbMATH DE number 843241 (Why is no real title available?)
• New characterizations of old bankruptcy rules
• On Dividing an Amount According to Individual Claims or Liabilities
• The bankruptcy problem: A cooperative bargaining approach
• The separability axiom and equal-sharing methods

Cited in

(2)

• The constrained equal loss rule in problems with constraints and claims
• Axiomatic characterizations of the CEA solution for rationing problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393010)