{"type":"ScholarlyArticle","title":"A Structural Approach to Activity Selection","authors":[{"name":"Eduard Eiben","slug":"eduard-eiben","given":"Eduard","family":"Eiben","affiliation":"Department of Informatics , University of Bergen , Norway"},{"name":"Robert Ganian","slug":"robert-ganian","given":"Robert","family":"Ganian","affiliation":"Algorithms and Complexity group , TU Wien , Austria"},{"name":"Sebastian Ordyniak","slug":"sebastian-ordyniak","given":"Sebastian","family":"Ordyniak","affiliation":"Algorithms group , University of Sheffield , UK"}],"abstract":"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.","doi":"10.24963/ijcai.2018/28","url":"https://ijcai.org/proceedings/2018/28","pdf":"https://ijcai.org/proceedings/2018/0028.pdf","markdown":"https://ijcai.org/proceedings/2018/28.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/28","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":28,"pages":{"first":203,"last":209},"keywords":["Agent-based and Multi-agent Systems: Coordination and Cooperation","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Bodlaender et al., 2016] Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lok- shtanov, and Michal Pilipczuk. A c k n 5-approximation al- gorithm for treewidth. SIAM J. Comput., 45(2):317-378, 2016.","title":"A c k n 5-approximation algorithm for treewidth","authors":"L Hans, Pål Bodlaender, Markus S Grønås Drange, Dregi, V Fedor, Daniel Fomin, Michal Lok-Shtanov, Pilipczuk","year":"2016","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bodlaender, 2008] Hans L. Bodlaender. Treewidth of graphs. In Encyclopedia of Algorithms. Springer, 2008.","title":"Treewidth of graphs","authors":"L Hans, Bodlaender","year":"2008","venue":"Encyclopedia of Algorithms","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parame- terized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Lukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michal Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Darmann and Lang, 2017] Andreas Darmann and Jérôme Lang. Trends in Computational Social Choice, chapter Group Activity Selection Problems. AI Access, 2017.","title":"Trends in Computational Social Choice, chapter Group Activity Selection Problems","authors":"Lang ; Darmann, Andreas Darmann, Jérôme Lang","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Darmann et al., 2012] Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Ger- hard J. Woeginger. Group activity selection problem. In WINE 2012, volume 7695 of Lecture Notes in Computer Science, pages 156-169. Springer, 2012.","title":"Group activity selection problem","authors":"Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J Woeginger","year":"2012","venue":"WINE 2012","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Darmann et al., 2017a] Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, and Sebastian Schnecken- burger. On simplified group activity selection. In ADT 2017, volume 10576 of Lecture Notes in Computer Sci- ence, pages 255-269. Springer, 2017.","title":"On simplified group activity selection","authors":"Darmann","year":"2017","venue":"ADT 2017","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Darmann et al., 2017b] Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Ger- hard Woeginger. Group activity selection problem with approval preferences. International Journal of Game The- ory, pages 1-30, 2017.","title":"Group activity selection problem with approval preferences","authors":"Darmann","year":"2017","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Darmann, 2015] Andreas Darmann. Group activity selec- tion from ordinal preferences. In ADT 2015, volume 9346 of Lecture Notes in Computer Science, pages 35-51. Springer, 2015.","title":"Group activity selection from ordinal preferences","authors":"Andreas Darmann","year":"2015","venue":"ADT 2015","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Demaine et al., 2014] Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sik- dar, and Blair D. Sullivan. Structural sparsity of complex networks: Random graph models and linear algorithms. CoRR, abs/1406.2587, 2014.","title":"Structural sparsity of complex networks: Random graph models and linear algorithms","authors":"Erik D Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D Sullivan","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Diestel, 2012] Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012.","title":"Graph Theory","authors":"Reinhard Diestel","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer Verlag, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Eiben et al., 2016] Eduard Eiben, Robert Ganian, and Se- bastian Ordyniak. Using decomposition-parameters for QBF: mind the prefix! In AAAI 2016, pages 964-970, 2016.","title":"Using decomposition-parameters for QBF: mind the prefix!","authors":"Eiben","year":"2016","venue":"AAAI 2016","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fellows et al., 2008] Michael R. Fellows, Daniel Loksh- tanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. Graph layout problems parameterized by vertex cover. In ISAAC 2008, pages 294-305, 2008.","title":"Graph layout problems parameterized by vertex cover","authors":"R Michael, Daniel Fellows, Neeldhara Lokshtanov, Frances A Misra, Saket Rosamond, Saurabh","year":"2008","venue":"ISAAC 2008","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Fellows et al., 2011] Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, and Carsten Thomassen. On the complex- ity of some colorful problems parameterized by treewidth. Information and Computation, 209(2):143-153, 2011.","title":"On the complexity of some colorful problems parameterized by treewidth","authors":"R Michael, Fedor V Fellows, Daniel Fomin, Frances Lokshtanov, Saket Rosamond, Stefan Saurabh, Carsten Szeider, Thomassen","year":"2011","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ganian et al., 2017] Robert Ganian, Sebastian Ordyniak, and M. S. Ramanujan. Going beyond primal treewidth for (M)ILP. In Satinder P. Singh and Shaul Markovitch, editors, AAAI 2017, pages 815-821. AAAI Press, 2017.","title":"Going beyond primal treewidth for (M)ILP","authors":"Robert Ganian, Sebastian Ordyniak, M S Ramanujan","year":"2017","venue":"AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Grohe et al., 2017] Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Deciding first-order properties of nowhere dense graphs. J. ACM, 64(3):17:1-17:32, 2017.","title":"Deciding first-order properties of nowhere dense graphs","authors":"Martin Grohe, Stephan Kreutzer, Sebastian Siebertz","year":"2017","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gupta et al., 2017] Sushmita Gupta, Sanjukta Roy, Saket Saurabh, and Meirav Zehavi. Group activity selection on graphs: Parameterized analysis. In SAGT 2017, volume 10504 of Lecture Notes in Computer Science, pages 106- 118. Springer, 2017.","title":"Group activity selection on graphs: Parameterized analysis","authors":"Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi","year":"2017","venue":"SAGT 2017","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Igarashi et al., 2017a] Ayumi Igarashi, Robert Bredereck, and Edith Elkind. On parameterized complexity of group activity selection problems on social networks. In AAMAS 2017, pages 1575-1577, 2017.","title":"On parameterized complexity of group activity selection problems on social networks","authors":"Igarashi","year":"2017","venue":"AAMAS 2017","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Igarashi et al., 2017b] Ayumi Igarashi, Robert Bredereck, and Edith Elkind. On parameterized complexity of group activity selection problems on social networks. CoRR, abs/1703.01121, 2017.","title":"On parameterized complexity of group activity selection problems on social networks","authors":"Igarashi","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Igarashi et al., 2017c] Ayumi Igarashi, Dominik Peters, and Edith Elkind. Group activity selection on social networks. In AAAI 2017, pages 565-571. AAAI Press, 2017.","title":"Group activity selection on social networks","authors":"Igarashi","year":"2017","venue":"AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lampis, 2012] Michael Lampis. Algorithmic meta- theorems for restrictions of treewidth. Algorithmica, 64(1):190-37, 2012.","title":"Algorithmic metatheorems for restrictions of treewidth","authors":"Michael Lampis","year":"2012","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lee and Shoham, 2015] Hooyeon Lee and Yoav Shoham. Stable invitations. In AAAI 2015, pages 965-971. AAAI Press, 2015.","title":"Stable invitations","authors":"Shoham ; Lee, Hooyeon Lee, Yoav Shoham","year":"2015","venue":"AAAI 2015","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lee and Williams, 2017a] Hooyeon Lee and Vassilevska Williams. Complexity of the stable invitations problem. In AAAI 2017, pages 579-585. AAAI Press, 2017.","title":"Complexity of the stable invitations problem","authors":"Lee, Williams ;, Hooyeon Lee, Vassilevska Williams","year":"2017","venue":"AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Lee and Williams, 2017b] Hooyeon Lee and Virginia Vas- silevska Williams. Parameterized complexity of group ac- tivity selection. In AAMAS 2017, pages 353-361, 2017.","title":"Hooyeon Lee and Virginia Vassilevska Williams. Parameterized complexity of group activity selection","authors":"Williams Lee","year":"2017","venue":"AAMAS 2017","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Nešetřil and de Mendez, 2012] Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity -Graphs, Structures, and Algorithms. Springer, 2012.","title":"Jaroslav Nešetřil and Patrice Ossona de Mendez","authors":"De Nešetřil, Mendez","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Orlin, 1988] James B. Orlin. A faster strongly polynominal minimum cost flow algorithm. In STOC 1988, pages 377- 387, 1988.","title":"A faster strongly polynominal minimum cost flow algorithm","authors":"James B Orlin","year":"1988","venue":"STOC 1988","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Reidl, 2016] F. Reidl. Structural sparseness and complex networks. PhD thesis, RWTH Aachen, 2016.","title":"Structural sparseness and complex networks","authors":"F Reidl","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Robertson and Seymour, 1984] Neil Robertson and Paul D. Seymour. Graph minors. III. planar tree-width. J. Comb. Theory, Ser. B, 36(1):49-64, 1984.","title":"Graph minors. III. planar tree-width","authors":"Neil Robertson, Paul D Seymour","year":"1984","venue":"J. Comb. Theory, Ser. B","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Samer and Szeider, 2010] Marko Samer and Stefan Szeider. Constraint satisfaction with bounded treewidth revisited. J. of Computer and System Sciences, 76(2):103-114, 2010.","title":"Constraint satisfaction with bounded treewidth revisited","authors":"Marko Samer, Stefan Szeider","year":"2010","venue":"J. of Computer and System Sciences","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}