A Structural Approach to Activity Selection

The general task of finding an assignment of agents to activities under certain stability and rationality constraints has led to the introduction of two prominent problems in the area of computational social choice: Group Activity Selection (GASP) and Stable Invitations (SIP). Here we introduce and study the Comprehensive Activity Selection Problem, which naturally generalizes both of these problems. In particular, we apply the parameterized complexity paradigm, which has already been successfully employed for SIP and GASP. While previous work has focused strongly on parameters such as solution size or number of activities, here we focus on parameters which capture the complexity of agent-to-agent interactions. Our results include a comprehensive complexity map for CAS under various restrictions on the number of activities in combination with restrictions on the complexity of agent interactions.

[1]  Edith Elkind,et al.  Group Activity Selection on Social Networks , 2017, AAAI.

[2]  Edith Elkind,et al.  On Parameterized Complexity of Group Activity Selection Problems on Social Networks , 2017, AAMAS.

[3]  Stephan Kreutzer,et al.  Deciding first-order properties of nowhere dense graphs , 2013, STOC.

[4]  Blair D. Sullivan,et al.  Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms , 2014, ArXiv.

[5]  Michael Lampis,et al.  Algorithmic Meta-theorems for Restrictions of Treewidth , 2010, Algorithmica.

[6]  Felix Reidl,et al.  Structural sparseness and complex networks , 2016 .

[7]  Ming-Yang Kao,et al.  Encyclopedia of Algorithms , 2016, Springer New York.

[8]  Marko Samer,et al.  Constraint satisfaction with bounded treewidth revisited , 2010, J. Comput. Syst. Sci..

[9]  Robert Ganian,et al.  Going Beyond Primal Treewidth for (M)ILP , 2017, AAAI.

[10]  Hooyeon Lee,et al.  Complexity of the Stable Invitations Problem , 2017, AAAI.

[11]  Janosch Döcker,et al.  On Simplified Group Activity Selection , 2017, ADT.

[12]  Robert Ganian,et al.  Using Decomposition-Parameters for QBF: Mind the Prefix! , 2016, AAAI.

[13]  Saket Saurabh,et al.  Group Activity Selection on Graphs: Parameterized Analysis , 2017, SAGT.

[14]  Michal Pilipczuk,et al.  A ck n 5-Approximation Algorithm for Treewidth , 2016, SIAM J. Comput..

[15]  Michael R. Fellows,et al.  On the Complexity of Some Colorful Problems Parameterized by Treewidth , 2007, COCOA.

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

[18]  Michael R. Fellows,et al.  Graph Layout Problems Parameterized by Vertex Cover , 2008, ISAAC.

[19]  D. Muijs,et al.  4th Edition , 2006 .