Abstract
AbstractIn this paper we study the class of claims problems where the amount to be divided is perfectly divisible and claims are made on indivisible units of several items. Each item has a price, and the available amount falls short to be able to cover all the claims at the given prices. We propose several properties that may be of interest in this particular framework. These properties represent the common principles of fairness, efficiency, and non-manipulability by merging or splitting. Efficiency is our focal principle, which is formalized by means of two axioms: non-wastefulness and Pareto efficiency. We show that some combinations of the properties we consider are compatible, others are not.
Funder
Ministerio de Ciencia, Innovación y Universidades
Agencia Estatal de Investigación
European Regional Development Fund
Ministerio de Ciencia e Innovación
Junta de Andalucía
Publisher
Springer Science and Business Media LLC
Subject
Management of Technology and Innovation,Strategy and Management,General Social Sciences,Arts and Humanities (miscellaneous),General Decision Sciences
Reference36 articles.
1. Arribillaga P, Bergantiños G (2019). Cooperative and axiomatic approaches to the knapsack allocation problem. MPRA Paper University Library of Munich, 91719
2. Aumann R, Maschler M (1985) Game theoretic analysis of a bankruptcy problem from the Talmud. J Econ Theory 36:195–213
3. Bergantiños G, Lorenzo L, Lorenzo-Freire S (2011) New characterizations of the constrained equal awards rule in multi-issue allocation situations. Math Methods Op Res 74:311–325
4. Calleja P, Borm P, Hendrickx R (2005) Multi-issue allocation situations. Euro J Op Res 164:730–747
5. Carpente L, Casas-Méndez B, Gozálvez J, Llorca N, Pulido M, Sánchez-Soriano J (2013) How to divide a cake when people have different metabolism? Math Methods Op Res 78:361–371
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献