Aggregator operators for dynamic rationing
From MaRDI portal
Publication:2028912
DOI10.1016/j.ejor.2020.06.007zbMath1487.91056OpenAlexW3034831528MaRDI QIDQ2028912
Juan D. Moreno-Ternero, Juan J. Vidal-Puga
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://www.upo.es/serv/bib/wps/econ2001.pdf
Related Items (4)
Compensation and sacrifice in the probabilistic rationing of indivisible units ⋮ Allocating \(\mathrm{CO}_2\) emissions: a dynamic claims problem ⋮ Broadcasting revenue sharing after cancelling sports competitions ⋮ Monotonicity in sharing the revenues from broadcasting sports leagues
Cites Work
- A unifying framework for the problem of adjudicating conflicting claims
- Weighted bankruptcy rules and the museum pass problem
- Compromise solutions for bankruptcy situations with references
- Operators for the adjudication of conflicting claims
- A problem of rights arbitration from the Talmud
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
- Additive rules in bankruptcy problems and other related problems.
- The Talmud rule and the securement of agents' awards.
- Game theory techniques for University management: An extended bankruptcy model
- Sustainable allocation of greenhouse gas emission permits for firms with Leontief technologies
- Multi-issue allocation situations
- A proportional approach to claims problems with a guaranteed minimum
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
- Characterization of the Reverse Talmud bankruptcy rule by exemption and exclusion properties
- Rationing with baselines: the composition extension operator
- Rationing in the presence of baselines
- The equal award principle in problems with constraints and claims
- Impartial division of a dollar
- Additive rules in discrete allocation problems
- Rationing problems with ex-ante conditions
- Impartiality, Priority, and Solidarity in the Theory of Justice
- How to Divide When There Isn't Enough
- Axiomatic characterizations of the CEA solution for rationing problems
This page was built for publication: Aggregator operators for dynamic rationing
