We study the properties of scoring allocation correspondences and rules, due to Baumeister et al. [7], that are based on a scoring vector (e.g., Borda or lexicographic scoring) and an aggregation function (e.g., utilitarian or egalitarian social welfare) and can be used to allocate indivisible goods to agents. Extending their previous results considerably and solving some of their open questions, we show that while necessary duplication monotonicity (a notion inspired by the twin paradox [21] and false-name manipulation [1]) fails for most choices of scoring vector when using leximin social welfare, possible duplication monotonicity holds for a very wide range of scoring allocation rules. We also show that a very large family of scoring allocation rules is monotonic. Finally, we show that a large class of scoring allocation correspondences satisfies possible Pareto-optimality, which extends a result of Brams et al. [12].
CITATION STYLE
Kuckuck, B., & Rothe, J. (2019). Monotonicity, Duplication Monotonicity, and Pareto Optimality in the Scoring-Based Allocation of Indivisible Goods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11327 LNAI, pp. 173–189). Springer Verlag. https://doi.org/10.1007/978-3-030-17294-7_13
Mendeley helps you to discover research relevant for your work.