Assigning a Small Agreeable Set of Indivisible Items to Multiple Players

We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen subset is \emph{agreeable} to all players, i.e., every player weakly prefers the chosen subset to any subset of its complement. For an arbitrary number of players, we derive tight upper bounds on the size for which a subset of that size that is agreeable to all players always exists when preferences are monotonic. We then present polynomial-time algorithms that find an agreeable subset of approximately half of the items when there are two or three players and preferences are responsive. Our results translate to a 2-approximation on the individual welfare of every player when preferences are subadditive.

[1]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory, Ser. A.

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

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

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

[5]  Avrim Blum,et al.  Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.

[6]  Sylvain Bouveret,et al.  Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.

[7]  N. Alon,et al.  The Borsuk-Ulam theorem and bisection of necklaces , 1986 .

[8]  Steven J. Brams,et al.  The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..

[9]  Hellmuth Kneser,et al.  Geschlossene Flächen in dreidimensionalen Mannigfaltigkeiten. , 1929 .

[10]  Vincent Conitzer,et al.  A double oracle algorithm for zero-sum security games on graphs , 2011, AAMAS.

[11]  Ariel D. Procaccia,et al.  On Maxsum Fair Cake Divisions , 2012, AAAI.

[12]  Tim Roughgarden,et al.  Welfare guarantees for combinatorial auctions with item bidding , 2011, SODA '11.

[13]  Ariel D. Procaccia,et al.  Optimal Envy-Free Cake Cutting , 2011, AAAI.

[14]  Francis Edward Su,et al.  Consensus-halving via theorems of Borsuk-Ulam and Tucker , 2003, Math. Soc. Sci..

[15]  Uriel Feige,et al.  On maximizing welfare when utility functions are subadditive , 2006, STOC '06.

[16]  Vincent Conitzer,et al.  Introduction to Computational Social Choice , 2016, Handbook of Computational Social Choice.

[17]  Nick Bostrom,et al.  Thinking Inside the Box: Controlling and Using an Oracle AI , 2012, Minds and Machines.

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

[19]  Ariel D. Procaccia,et al.  No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.

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

[21]  Haris Aziz,et al.  A note on the undercut procedure , 2013, AAMAS.

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

[23]  Peter C. Fishburn,et al.  Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity , 2000, Soc. Choice Welf..

[24]  Jirí Matousek,et al.  A Combinatorial Proof of Kneser’s Conjecture* , 2004, Comb..