Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels

We study the problem of finding a Pareto-efficient and envy-free allocation of a set of indivisible resources to a set of agents with monotonic preferences, either dichotomous or additive. Motivated by results of Bouveret and Lang [JAIR 2008], we provide a refined computational complexity analysis by studying the influence of three natural parameters: the number n of agents, the number m of resources, and the number z of different numbers occurring in utility-based preferences of the agents. On the negative side, we show that small values for n and z alone do not significantly lower the computational complexity in most cases. On the positive side, devising fixed-parameter algorithms we show that all considered problems are tractable in case of small m. Furthermore, we develop a fixed-parameter algorithm indicating that the problem with additive preferences becomes computationally tractable in case of small n and small z.

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

[2]  Friedhelm Meyer auf der Heide,et al.  Theory of Computing Systems: Guest Editors' Foreword , 2003 .

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

[4]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

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

[6]  Jacobo Torán,et al.  Computing Functions with Parallel Queries to NP , 1995, Theor. Comput. Sci..

[7]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[8]  Michael R. Fellows,et al.  Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.

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

[10]  Robert M Thrall,et al.  Mathematics of Operations Research. , 1978 .

[11]  Toby Walsh,et al.  Challenges in Resource and Cost Allocation , 2015, AAAI.

[12]  M. Nivat.  Theoretical Computer Science Volume 213-214 , 1999 .

[13]  Martin Mundhenk,et al.  How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms , 2011, SAT.

[14]  Klaus Jansen,et al.  Bin packing with fixed number of bins revisited , 2013, J. Comput. Syst. Sci..

[15]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[16]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[17]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[18]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[19]  Stefan Kratsch,et al.  Kernelization Lower Bounds by Cross-Composition , 2012, SIAM J. Discret. Math..

[20]  Stefan Szeider,et al.  Parameterized Complexity Results for Agenda Safety in Judgment Aggregation , 2015, AAMAS.

[21]  Stefan Szeider,et al.  Fixed-Parameter Tractable Reductions to SAT , 2014, SAT.

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

[23]  Jörg Rothe,et al.  How to Decrease the Degree of Envy in Allocations of Indivisible Goods , 2013, ADT.

[24]  Yann Chevaleyre,et al.  Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.

[25]  Federica Mandreoli,et al.  Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data , 2016, Journal of computer and system sciences (Print).

[26]  Michael R. Fellows,et al.  Parameterizing by the Number of Numbers , 2011, Theory of Computing Systems.

[27]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..