Lower bounds and recursive methods for the problem of adjudicating conflicting claims
From MaRDI portal
Publication:2452116
DOI10.1007/s00355-011-0632-4zbMath1288.91123OpenAlexW2072133557MaRDI QIDQ2452116
Publication date: 30 May 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-011-0632-4
Related Items (4)
A new approach for bounding awards in bankruptcy problems ⋮ Resource allocations with guaranteed awards in claims problems ⋮ Families of sequential priority rules and random arrival rules with withdrawal limits ⋮ Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
Cites Work
- Secured lower bound, composition up, and minimal rights first for bankruptcy problems
- Operators for the adjudication of conflicting claims
- Game theoretic analysis of a bankruptcy problem from the Talmud
- A problem of rights arbitration from the Talmud
- The Talmud rule and the securement of agents' awards.
- On the axiomatic method and its recent applications to game theory and resource allocation
- A new solution to the problem of adjudicating conflicting claims
- A quadratic programming model for product configuration optimization
- Priority Rules and Other Asymmetric Rationing Methods
This page was built for publication: Lower bounds and recursive methods for the problem of adjudicating conflicting claims
