Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (rather than utility functions) and when our knowledge of those preferences is incomplete. The incompleteness of the preferences stems from the fact that each agent reports their preferences by means of an expression of bounded size in a compact preference representation language. Specifically, we assume that each agent only provides a ranking of individual goods (rather than of bundles). In this context, we consider the algorithmic problem of deciding whether there exists an allocation that is possibly (or necessarily) envy-free, given the incomplete preference information available, if in addition some mild economic efficiency criteria need to be satisfied. We provide simple characterisations, giving rise to simple algorithms, for some instances of the problem, and computational complexity results, establishing the intractability of the problem, for others.

[1]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[2]  Amin Saberi,et al.  An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods , 2010, SIAM J. Comput..

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

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

[5]  Yann Chevaleyre,et al.  Allocating Goods on a Graph to Eliminate Envy , 2007, AAAI.

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

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

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

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

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

[11]  W. Bossert,et al.  Ranking Sets of Objects , 2001 .

[12]  Yann Chevaleyre,et al.  Preference Handling in Combinatorial Domains: From AI to Social Choice , 2008, AI Mag..

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

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

[15]  Amartya Sen,et al.  Welfare, preference and freedom , 1991 .

[16]  Ulrich Endriss,et al.  Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods , 2009, IJCAI.