Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity

We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by assuming that agents have dichotomous preferences expressed by propositional formulae. We express efficiency and envy-freeness in a logical setting, which reveals unexpected connections to nonmonotonic reasoning. Then we identify the complexity of determining whether there exists an efficient and envy-free allocation, for several notions of efficiency, when preferences are represented in a succinct way (as well as restrictions of this problem). We first study the problem under the assumption that preferences are dichotomous, and then in the general case.

[1]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

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

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[5]  Jérôme Lang,et al.  Allocation of indivisible goods: a general model and some complexity results , 2005, AAMAS '05.

[6]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[7]  H. Peyton Young,et al.  Equity - in theory and practice , 1994 .

[8]  Yann Chevaleyre,et al.  Reaching Envy-Free States in Distributed Negotiation Settings , 2007, IJCAI.

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

[10]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[11]  Noam Nisan,et al.  Bidding Languages for Combinatorial Auctions , 2005 .

[12]  Tuomas Sandholm.  Contract Types for Satisficing Task Allocation:I Theoretical Results , 2002 .

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

[14]  Yoav Shoham,et al.  Marginal contribution nets: a compact representation scheme for coalitional games , 2005, EC '05.

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

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

[17]  Yann Chevaleyre,et al.  Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling , 2006, KR.

[18]  Douglas Muzzio,et al.  APPROVAL VOTING , 1983 .

[19]  Steven J. Brams,et al.  Mathematics and democracy: Designing better voting and fair-division procedures , 2008, Math. Comput. Model..

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

[21]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

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

[23]  P. E. Dunne,et al.  Extremal Behaviour in Multiagent Contract Negotiation , 2011, J. Artif. Intell. Res..

[24]  Jérôme Lang,et al.  Logical Preference Representation and Combinatorial Vote , 2004, Annals of Mathematics and Artificial Intelligence.

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

[26]  Richard Stong,et al.  Collective choice under dichotomous preferences , 2005, J. Econ. Theory.

[27]  Steven J. Brams,et al.  Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure , 2007, Fair Division.

[28]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

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

[30]  Vincent Conitzer,et al.  Communication complexity of common voting rules , 2005, EC '05.

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

[32]  Miroslaw Truszczynski,et al.  The First Answer Set Programming System Competition , 2007, LPNMR.

[33]  Nicolas Maudet,et al.  Negotiating Socially Optimal Allocations of Resources , 2011, J. Artif. Intell. Res..

[34]  Michael Wooldridge,et al.  The complexity of contract negotiation , 2005, Artif. Intell..

[35]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[36]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[37]  Craig Boutilier,et al.  Bidding Languages for Combinatorial Auctions , 2001, IJCAI.