Characterizing conflicts in fair division of indivisible goods using a scale of criteria

We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to characterize how conflicting the agents’ preferences are: for a given instance of a resource allocation problem, the less conflicting the agents’ preferences are, the more demanding criterion this instance is able to satisfy, and the more satisfactory the allocation can be. We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with $$k$$k-additive preferences.

[1]  Evangelos Markakis,et al.  On Worst-Case Allocations in the Presence of Indivisible Goods , 2011, WINE.

[2]  H. Moulin.  Cooperative Microeconomics: A Game-Theoretic Introduction , 1995 .

[3]  Christos H. Papadimitriou,et al.  The Complexity of Fairness Through Equilibrium , 2013, ACM Trans. Economics and Comput..

[4]  Clemens Puppe,et al.  A simple procedure for finding equitable allocations of indivisible goods , 2002, Soc. Choice Welf..

[5]  Ulrich Endriss,et al.  Measuring Diversity of Preferences in a Group , 2014, ECAI.

[6]  Amin Saberi,et al.  An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.

[7]  Jérôme Lang,et al.  Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.

[8]  I. Fisher.  Mathematical Investigations in the Theory of Value and Prices , 1893 .

[9]  H. Moulin.  Axioms of Cooperative Decision Making , 1988 .

[10]  Ivona Bezáková,et al.  Allocating indivisible goods , 2005, SECO.

[11]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[12]  Peter C. Fishburn,et al.  Paradoxes of Fair Division , 2001 .

[13]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[14]  Ariel D. Procaccia,et al.  Cake cutting: not just child's play , 2013, CACM.

[15]  H. Moulin.  Fair division under joint ownership: Recent results and open problems , 1990 .

[16]  Theodore P. Hill,et al.  Partitioning General Probability Measures , 1987 .

[17]  D. Foley.  Resource allocation and the public sector , 1967 .

[18]  S. Brams,et al.  Efficient Fair Division , 2005 .

[19]  Dan W. Brockt,et al.  The Theory of Justice , 2017 .

[20]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[21]  Lirong Xia.  Assigning indivisible and categorized items , 2014, ISAIM.

[22]  Tuomas Sandholm,et al.  Finding approximate competitive equilibria: efficient and fair course allocation , 2010, AAMAS.

[23]  Michel Grabisch,et al.  K-order Additive Discrete Fuzzy Measures and Their Representation , 1997, Fuzzy Sets Syst..

[24]  Ariel D. Procaccia,et al.  The Computational Rise and Fall of Fairness , 2014, AAAI.

[25]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[26]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[27]  Gérard Verfaillie,et al.  Exploiting a Common Property Resource under a Fairness Constraint: a Case Study , 1999, IJCAI.

[28]  V. Vazirani.  Algorithmic Game Theory: Combinatorial Algorithms for Market Equilibria , 2007 .

[29]  Toby Walsh,et al.  Fair assignment of indivisible objects under ordinal preferences , 2013, AAMAS.

[30]  H. Moulin.  Uniform externalities: Two axioms for fair allocation , 1990 .

[31]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[32]  Carmen Beviá Baeza.  Fair allocation in a general model with indivisible goods , 1994 .

[33]  Christos H. Papadimitriou,et al.  The complexity of fairness through equilibrium , 2014, EC.

[34]  A. Sen,et al.  Collective Choice and Social Welfare , 2017 .

[35]  Marco Dall'Aglio,et al.  Maximin share and minimax envy in fair-division problems , 2003 .

[36]  Jörg Rothe,et al.  Scoring Rules for the Allocation of Indivisible Goods , 2014, ECAI.

[37]  Yann Chevaleyre,et al.  Multiagent Resource Allocation with K -additive Utility Functions , 2004 .

[38]  Theodore P. Hill,et al.  Equitable distribution of indivisible objects , 1988 .

[39]  Ulrich Endriss,et al.  Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods , 2010, ECAI.

[40]  Craig Boutilier,et al.  Optimal social choice functions: a utilitarian view , 2012, EC '12.

[41]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[42]  Peter C. Fishburn,et al.  FAIR DIVISION OF INDIVISIBLE ITEMS , 2003 .

[43]  Jérôme Lang,et al.  A General Elicitation-Free Protocol for Allocating Indivisible Goods , 2011, IJCAI.

[44]  Jérôme Monnot,et al.  On regular and approximately fair allocations of indivisible goods , 2014, AAMAS.

[45]  Yingqian Zhang,et al.  On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences , 2009, ADT.

[46]  H. Scarf,et al.  How to Compute Equilibrium Prices in 1891 , 2005 .

[47]  Steven J. Brams,et al.  The win-win solution - guaranteeing fair shares to everybody , 1999 .

[48]  Léon Walras.  Éléments d'économie politique pure, ou, Théorie de la richesse sociale , 1976 .

[49]  蔡森昌.  饒斯對功效主義（Utilitarianism）的批評 , 1994 .

[50]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.