{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:37:10Z","timestamp":1777894630193,"version":"3.51.4"},"reference-count":127,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:00:00Z","timestamp":1772841600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2024-0040"],"award-info":[{"award-number":["2024-0040"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2021-R1-I1A2"],"award-info":[{"award-number":["2021-R1-I1A2"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["059735"],"award-info":[{"award-number":["059735"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2019-II19"],"award-info":[{"award-number":["2019-II19"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2025-2544 (3209)"],"award-info":[{"award-number":["2025-2544 (3209)"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2024-0044(0881)"],"award-info":[{"award-number":["2024-0044(0881)"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2022R1C1C2003637"],"award-info":[{"award-number":["2022R1C1C2003637"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Science Review"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cosrev.2025.100835","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T10:10:15Z","timestamp":1770804615000},"page":"100835","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computational Social Choice: Parameterized complexity and challenges"],"prefix":"10.1016","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8163-1327","authenticated-orcid":false,"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[]},{"given":"Christian","family":"Hatschka","sequence":"additional","affiliation":[]},{"given":"Sofia","family":"Simola","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cosrev.2025.100835_b1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00303169","article-title":"Voting schemes for which it can be difficult to tell who won the election","volume":"6","author":"Bartholdi III","year":"1989","journal-title":"Soc. Choice Welf."},{"key":"10.1016\/j.cosrev.2025.100835_b2","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1145\/268999.269002","article-title":"Exact analysis of dodgson elections: Lewis carroll\u2019s 1876 voting system is complete for parallel access to NP","volume":"44","author":"Hemaspaandra","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/j.cosrev.2025.100835_b3","first-page":"217","article-title":"On complexity of lobbying in multiple referenda","volume":"11","author":"Christian","year":"2007","journal-title":"Rev. Econ. Des."},{"key":"10.1016\/j.cosrev.2025.100835_b4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1613\/jair.4285","article-title":"A multivariate complexity analysis of lobbying in multiple referenda","volume":"50","author":"Bredereck","year":"2014","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.cosrev.2025.100835_b5","doi-asserted-by":"crossref","unstructured":"J. Chen, R. Ganian, T. Hamm, Stable matchings with diversity constraints: Affirmative action is beyond NP, in: Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI \u201920, 2020, pp. 146\u2013152.","DOI":"10.24963\/ijcai.2020\/21"},{"key":"10.1016\/j.cosrev.2025.100835_b6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.mathsocsci.2012.10.001","article-title":"A hardness result for core stability in additive hedonic games","volume":"65","author":"Woeginger","year":"2013","journal-title":"Math. Social Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b7","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.cosrev.2025.100835_b8","series-title":"Parameterized Complexity. Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"Downey","year":"1999"},{"key":"10.1016\/j.cosrev.2025.100835_b9","series-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.cosrev.2025.100835_b10","series-title":"Invitation To Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.cosrev.2025.100835_b11","series-title":"Texts in Theoretical Computer Science. An EATCS Series","article-title":"Parameterized complexity theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.cosrev.2025.100835_b12","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.cosrev.2025.100835_b13","series-title":"Supplement in the Mathematical Programming Glossary","article-title":"Fixed-parameter tractability and parameterized complexity applied to problems from computational social choice","author":"Lindner","year":"2008"},{"key":"10.1016\/j.cosrev.2025.100835_b14","series-title":"The Multivariate Algorithmic Revolution and beyond","first-page":"318","article-title":"Studies in computational aspects of voting\u2014A parameterized complexity perspective","author":"Betzler","year":"2012"},{"key":"10.1016\/j.cosrev.2025.100835_b15","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TST.2014.6867518","article-title":"Parameterized algorithmics for computational social choice: Nine research challenges","volume":"19","author":"Bredereck","year":"2014","journal-title":"Tsinghua Sci. Technol."},{"key":"10.1016\/j.cosrev.2025.100835_b16","series-title":"Trends in Computational Social Choice","first-page":"209","article-title":"Having a hard time? Explore parameterized complexity!","author":"Dorn","year":"2017"},{"key":"10.1016\/j.cosrev.2025.100835_b17","doi-asserted-by":"crossref","unstructured":"S. Gupta, S. Roy, S. Saurabh, M. Zehavi, Some hard stable marriage problems: A survey on multivariate analysis, in: S. Neogy, R.B. Bapat, D. Dubey (Eds.), Mathematical Programming and Game Theory, 2018, pp. 141\u2013157.","DOI":"10.1007\/978-981-13-3059-9_8"},{"key":"10.1016\/j.cosrev.2025.100835_b18","series-title":"Online and Martching-Based Market Design","first-page":"283","article-title":"Algorithmics of matching markets","author":"Chen","year":"2023"},{"key":"10.1016\/j.cosrev.2025.100835_b19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1613\/jair.3896","article-title":"On the computation of fully proportional representation","volume":"47","author":"Betzler","year":"2013","journal-title":"J. Artificial Intelligence Res."},{"issue":"28","key":"10.1016\/j.cosrev.2025.100835_b20","article-title":"Parameterized complexity of multiwinner determination: More effort towards fixed-parameter tractability","volume":"37","author":"Yang","year":"2023","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.cosrev.2025.100835_b21","doi-asserted-by":"crossref","unstructured":"N. Misra, A. Nabeel, H. Singh, On the parameterized complexity of minimax approval voting, in: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015, pp. 97\u2013105.","DOI":"10.65109\/GZSK1968"},{"key":"10.1016\/j.cosrev.2025.100835_b22","series-title":"Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems","doi-asserted-by":"crossref","first-page":"341","DOI":"10.65109\/FLGL9019","article-title":"Parameterized complexity of winner determination in minimax committee elections","author":"Liu","year":"2016"},{"key":"10.1016\/j.cosrev.2025.100835_b23","doi-asserted-by":"crossref","unstructured":"J. Chen, C. Hatschka, S. Simola, Efficient algorithms for Monroe and CC rules in multi-winner elections with (nearly) structured preferences, in: Proceedings of the 26th European Conference on Artificial Intelligence, ECAI \u201923, 2023, pp. 397\u2013404.","DOI":"10.3233\/FAIA230296"},{"key":"10.1016\/j.cosrev.2025.100835_b24","doi-asserted-by":"crossref","unstructured":"D. Peters, Graphical hedonic games of bounded treewidth, in: Proceedings of the 30th AAAI Conference on Artificial Intelligence, AAAI \u201916, 2016, pp. 586\u2013593.","DOI":"10.1609\/aaai.v30i1.10046"},{"key":"10.1016\/j.cosrev.2025.100835_b25","doi-asserted-by":"crossref","unstructured":"J. Chen, G. Cs\u00e1ji, S. Roy, S. Simola, Hedonic games with friends, enemies, and neutrals: Resolving open questions and fine-grained complexity, in: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201923, 2023, pp. 251\u2013259.","DOI":"10.65109\/XEHQ9286"},{"key":"10.1016\/j.cosrev.2025.100835_b26","doi-asserted-by":"crossref","unstructured":"M. Durand, L. Erlacher, J.M. Vistisen, S. Simola, Parameterized complexity of hedonic games with enemy-aversion preferences, in: Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201925, 2025.","DOI":"10.65109\/ZBEY1293"},{"key":"10.1016\/j.cosrev.2025.100835_b27","series-title":"35th International Symposium on Algorithms and Computation","first-page":"39:1","article-title":"Core stability in additively separable hedonic games of low treewidth","author":"Hanaka","year":"2024"},{"key":"10.1016\/j.cosrev.2025.100835_b28","unstructured":"T. Hanaka, M. Lampis, Hedonic games and treewidth revisited, in: Proceedings of the 30th Annual European Symposium on Algorithms, ESA \u201922, 2022, pp. 64:1\u201364:16."},{"key":"10.1016\/j.cosrev.2025.100835_b29","series-title":"Trends in Computational Social Choice","first-page":"27","article-title":"Multiwinner voting: A new challenge for social choice theory","author":"Faliszewski","year":"2017"},{"key":"10.1016\/j.cosrev.2025.100835_b30","series-title":"Springer Briefs in Intelligent Systems","article-title":"Multi-winner voting with approval preferences\u2013artificial intelligence, multiagent systems, and cognitive robotics","author":"Lackner","year":"2023"},{"key":"10.1016\/j.cosrev.2025.100835_b31","doi-asserted-by":"crossref","unstructured":"A.A. Ageev, M. Sviridenko, Approximation algorithms for maximum coverage and max cut with given sizes of parts, in: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization, 1999, pp. 17\u201330.","DOI":"10.1007\/3-540-48777-8_2"},{"key":"10.1016\/j.cosrev.2025.100835_b32","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1051\/ita\/2016022","article-title":"Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems","volume":"50","author":"Bonnet","year":"2016","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10.1016\/j.cosrev.2025.100835_b33","doi-asserted-by":"crossref","unstructured":"P.K. Skowron, P. Faliszewski, Fully proportional representation with approval ballots: Approximating the maxcover problem with bounded frequencies in FPT time, in: Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI \u201915, 2015, pp. 2124\u20132130.","DOI":"10.1609\/aaai.v29i1.9432"},{"key":"10.1016\/j.cosrev.2025.100835_b34","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","article-title":"On covering problems of codes","volume":"30","author":"Frances","year":"1997","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.cosrev.2025.100835_b35","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/506147.506150","article-title":"On the closest string and substring problems","volume":"49","author":"Li","year":"2002","journal-title":"J. ACM"},{"key":"10.1016\/j.cosrev.2025.100835_b36","unstructured":"J. Chen, D. Hermelin, M. Sorge, On computing centroids according to the p-norms of hamming distance vectors, in: Proceedings of the 27th Annual European Symposium on Algorithms, ESA \u201919, 2019, pp. 28:1\u201328:16."},{"key":"10.1016\/j.cosrev.2025.100835_b37","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","article-title":"Stable matching with preferences derived from a psychological model","volume":"5","author":"Bartholdi III","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cosrev.2025.100835_b38","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jagm.1994.1010","article-title":"A polynomial time algorithm for unidimensional unfolding representations","volume":"16","author":"Doignon","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/j.cosrev.2025.100835_b39","series-title":"Proceedings of the 18th European Conference on Artificial Intelligence","first-page":"366","article-title":"Single-peaked consistency and its complexity","author":"Escoffier","year":"2008"},{"key":"10.1016\/j.cosrev.2025.100835_b40","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s00355-010-0476-3","article-title":"A characterization of the single-peaked domain","volume":"36","author":"Ballester","year":"2011","journal-title":"Soc. Choice Welf."},{"key":"10.1016\/j.cosrev.2025.100835_b41","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1007\/s00355-012-0717-8","article-title":"A characterization of the single-crossing domain","volume":"41","author":"Bredereck","year":"2013","journal-title":"Soc. Choice Welf."},{"key":"10.1016\/j.cosrev.2025.100835_b42","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b43","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.mathsocsci.2015.11.002","article-title":"Are there any nicely structured preference profiles nearby?","volume":"79","author":"Bredereck","year":"2016","journal-title":"Math. Soc. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b44","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1613\/jair.5210","article-title":"Computational aspects of nearly single-peaked electorates","volume":"58","author":"Erd\u00e9lyi","year":"2017","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.cosrev.2025.100835_b45","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(01)00325-8","article-title":"A note on the consecutive ones submatrix problem","volume":"83","author":"Hajiaghayi","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.cosrev.2025.100835_b46","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1007\/s00453-014-9925-1","article-title":"Obtaining matrices with the consecutive ones property by row deletions","volume":"71","author":"Narayanaswamy","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2025.100835_b47","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","article-title":"On the complexity of achieving proportional representation","volume":"30","author":"Procaccia","year":"2008","journal-title":"Soc. Choice Welf."},{"key":"10.1016\/j.cosrev.2025.100835_b48","unstructured":"R. LeGrand, Analysis of the Minimax Procedure, Technical Report, 2004."},{"key":"10.1016\/j.cosrev.2025.100835_b49","unstructured":"E. Elkind, M. Lackner, Structure in dichotomous preferences, in: Proceedings of the 24th International Joint Conference on Artificial Intelligence, IJCAI \u201915, 2015, pp. 2019\u20132025."},{"key":"10.1016\/j.cosrev.2025.100835_b50","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.tcs.2014.12.012","article-title":"The complexity of fully proportional representation for single-crossing electorates","volume":"569","author":"Skowron","year":"2015","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b51","series-title":"International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"1","article-title":"Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT","author":"Fellows","year":"2003"},{"key":"10.1016\/j.cosrev.2025.100835_b52","unstructured":"J. Chen, S. Roy, Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule, Technical Report, 2022, arXiv:2202.12006."},{"key":"10.1016\/j.cosrev.2025.100835_b53","doi-asserted-by":"crossref","unstructured":"H. Aziz, S. Gaspers, J. Gudmundsson, S. Mackenzie, N. Mattei, T. Walsh, Computational aspects of multi-winner approval voting, in: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201915, 2015, pp. 107\u2013115.","DOI":"10.65109\/NHTY2001"},{"key":"10.1016\/j.cosrev.2025.100835_b54","doi-asserted-by":"crossref","unstructured":"N. Misra, C. Sonar, P.R. Vaidyanathan, On the complexity of Chamberlin-Courant on almost structured profiles, in: Proceedings of the 5th International Conference on Algorithmic Decision Theory, ADT \u201917, 2017, pp. 124\u2013138.","DOI":"10.1007\/978-3-319-67504-6_9"},{"key":"10.1016\/j.cosrev.2025.100835_b55","series-title":"Algorithmics of Matching under Preferences","author":"Manlove","year":"2013"},{"key":"10.1016\/j.cosrev.2025.100835_b56","series-title":"Handbook of Computational Social Choice","first-page":"356","article-title":"Hedonic games","author":"Aziz","year":"2016"},{"key":"10.1016\/j.cosrev.2025.100835_b57","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s00355-006-0104-4","article-title":"Simple priorities and core stability in hedonic games","volume":"26","author":"Dimitrov","year":"2006","journal-title":"Soc. Choice Welf."},{"key":"10.1016\/j.cosrev.2025.100835_b58","series-title":"International Conference on Algorithmic Decision Theory","first-page":"214","article-title":"Precise complexity of the core in dichotomous and additive hedonic games","author":"Peters","year":"2017"},{"key":"10.1016\/j.cosrev.2025.100835_b59","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1007\/s00224-009-9176-8","article-title":"Nash stability in additively separable hedonic games and community structures","author":"Olsen","year":"2009","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.cosrev.2025.100835_b60","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","article-title":"Computational complexity in additive hedonic games","volume":"203","author":"Sung","year":"2010","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cosrev.2025.100835_b61","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/game.2001.0877","article-title":"The stability of hedonic coalition structures","volume":"38","author":"Bogomolnaia","year":"2002","journal-title":"Games Econom. Behav."},{"key":"10.1016\/j.cosrev.2025.100835_b62","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1287\/moor.2018.0960","article-title":"Computing stable outcomes in symmetric additively separable hedonic games","volume":"44","author":"Gairing","year":"2019","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cosrev.2025.100835_b63","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b64","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.orl.2006.03.011","article-title":"On core membership testing for hedonic coalition formation games","volume":"35","author":"Sung","year":"2007","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cosrev.2025.100835_b65","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.artint.2012.09.006","article-title":"Computing desirable partitions in additively separable hedonic games","volume":"195","author":"Aziz","year":"2013","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cosrev.2025.100835_b66","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.artint.2024.104160","article-title":"Stability based on single-agent deviations in additively separable hedonic games","volume":"334","author":"Brandt","year":"2024","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cosrev.2025.100835_b67","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10472-015-9461-y","article-title":"Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games","volume":"77","author":"Rey","year":"2016","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.cosrev.2025.100835_b68","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","article-title":"Multivariate complexity analysis of swap bribery","volume":"64","author":"Dorn","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2025.100835_b69","unstructured":"S. Gupta, P. Jain, S. Roy, S. Saurabh, M. Zehavi, On the (parameterized) complexity of almost stable marriage, in: Proceedings of the 40th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS \u201920, 2020, pp. 24:1\u201324:17."},{"key":"10.1016\/j.cosrev.2025.100835_b70","doi-asserted-by":"crossref","unstructured":"E. Ceylan, J. Chen, S. Roy, Optimal seat arrangement: What are the hard and easy cases?, in: Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI \u201923, 2023, pp. 2563\u20132571.","DOI":"10.24963\/ijcai.2023\/285"},{"key":"10.1016\/j.cosrev.2025.100835_b71","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.cosrev.2025.100835_b72","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonzalez","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b73","doi-asserted-by":"crossref","unstructured":"K. Sornat, V.V. Williams, Y. Xu, Near-tight algorithms for the chamberlin-courant and thiele voting rules, in: Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI \u201922, 2022, pp. 482\u2013488.","DOI":"10.24963\/ijcai.2022\/69"},{"key":"10.1016\/j.cosrev.2025.100835_b74","doi-asserted-by":"crossref","first-page":"3717","DOI":"10.1007\/s00453-023-01155-7","article-title":"Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules","volume":"85","author":"Gupta","year":"2023","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2025.100835_b75","doi-asserted-by":"crossref","unstructured":"M. Ayadi, N.B. Amor, J. Lang, D. Peters, Single transferable vote: Incomplete knowledge and communication issues, in: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201919, 2019, pp. 1288\u20131296.","DOI":"10.65109\/VDZD7109"},{"issue":"27","key":"10.1016\/j.cosrev.2025.100835_b76","article-title":"Gehrlein stability in committee selection: Parameterized hardness and algorithms","volume":"34","author":"Gupta","year":"2020","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.cosrev.2025.100835_b77","unstructured":"D. Cornaz, L. Galand, O. Spanjaard, Bounded single-peaked width and proportional representation, in: Proceedings of the 20th European Conference on Artificial Intelligence, ECAI \u201912, vol. 27, 2012, pp. 0\u2013275."},{"key":"10.1016\/j.cosrev.2025.100835_b78","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1613\/jair.1.11732","article-title":"Preferences single-peaked on a circle","volume":"68","author":"Peters","year":"2020","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.cosrev.2025.100835_b79","doi-asserted-by":"crossref","unstructured":"P. Faliszewski, A. Slinko, N. Talmon, Multiwinner rules with variable number of winners, in: Proceedings of the 10th Conference on Prestigious Applications of Artificial Intelligence, PAIS 2020, 2020, pp. 67\u201374.","DOI":"10.3233\/FAIA200077"},{"key":"10.1016\/j.cosrev.2025.100835_b80","doi-asserted-by":"crossref","unstructured":"S.N. Sivarajan, A Generalization of the Minisum and Minimax Voting Methods, Technical Report, 2018, arXiv:1611.01364v2 [cs.GT].","DOI":"10.1137\/16S014870"},{"key":"10.1016\/j.cosrev.2025.100835_b81","doi-asserted-by":"crossref","unstructured":"Y. Yang, J. Wang, Multiwinner voting with restricted admissible sets: Complexity and strategyproofness, in: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI \u201918, 2018, pp. 576\u2013582.","DOI":"10.24963\/ijcai.2018\/80"},{"key":"10.1016\/j.cosrev.2025.100835_b82","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.2566","article-title":"Complexity of strategic behavior in multi-winner elections","volume":"33","author":"Meir","year":"2008","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.cosrev.2025.100835_b83","doi-asserted-by":"crossref","unstructured":"Y. Yang, Complexity of manipulating and controlling approval-based multiwinner voting, in: Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI \u201919, 2019, pp. 637\u2013643.","DOI":"10.24963\/ijcai.2019\/90"},{"key":"10.1016\/j.cosrev.2025.100835_b84","doi-asserted-by":"crossref","unstructured":"P. Faliszewski, P. Skowron, N. Talmon, Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules, in: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201917, 2017, pp. 6\u201314.","DOI":"10.65109\/GVQO7469"},{"issue":"38","key":"10.1016\/j.cosrev.2025.100835_b85","article-title":"On coalitional manipulation for multiwinner elections: shortlisting","volume":"35","author":"Bredereck","year":"2021","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.cosrev.2025.100835_b86","doi-asserted-by":"crossref","unstructured":"Y. Yang, On the complexity of destructive bribery in approval-based multi-winner voting, in: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201920, 2020, pp. 1584\u20131592.","DOI":"10.65109\/QHPC9003"},{"key":"10.1016\/j.cosrev.2025.100835_b87","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1145\/3470647","article-title":"Complexity of shift bribery in committee elections","volume":"13","author":"Bredereck","year":"2021","journal-title":"ACM Trans. Comput. Theory"},{"key":"10.1016\/j.cosrev.2025.100835_b88","doi-asserted-by":"crossref","unstructured":"Y. Yang, On the Parameterized Complexity of Controlling Approval-Based Multiwinner Voting: Destructive Model & Sequential Rules, Technical Report, 2023, arXiv:2304.11927v2.","DOI":"10.2139\/ssrn.4873487"},{"key":"10.1016\/j.cosrev.2025.100835_b89","doi-asserted-by":"crossref","unstructured":"K. Ota, N. Barrot, A. Ismaili, Y. Sakurai, M. Yokoo, Core stability in hedonic games among friends and enemies: Impact of neutrals, in: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI \u201917, 2017, pp. 359\u2013365.","DOI":"10.24963\/ijcai.2017\/51"},{"key":"10.1016\/j.cosrev.2025.100835_b90","doi-asserted-by":"crossref","unstructured":"N. Barrot, K. Ota, Y. Sakurai, M. Yokoo, Unknown agents in friends oriented hedonic games: Stability and complexity, in: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, AAAI \u201919, 2019, pp. 1756\u20131763.","DOI":"10.1609\/aaai.v33i01.33011756"},{"key":"10.1016\/j.cosrev.2025.100835_b91","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s001820000053","article-title":"Stability in coalition formation games","volume":"29","author":"Cechl\u00e1rov\u00e1","year":"2001","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.cosrev.2025.100835_b92","series-title":"Proceedings of International Conference on Autonomous Agents and Multiagent Systems","doi-asserted-by":"crossref","first-page":"417","DOI":"10.65109\/KSSZ8958","article-title":"Hedonic coalition nets","author":"Elkind","year":"2009"},{"key":"10.1016\/j.cosrev.2025.100835_b93","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3327970","article-title":"Fractional hedonic games","volume":"7","author":"Aziz","year":"2019","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"10.1016\/j.cosrev.2025.100835_b94","doi-asserted-by":"crossref","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","article-title":"College admissions and the stability of marriage","volume":"120","author":"Gale","year":"1962","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.cosrev.2025.100835_b95","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","article-title":"NP-complete stable matching problems","volume":"11","author":"Ronn","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/j.cosrev.2025.100835_b96","doi-asserted-by":"crossref","unstructured":"G.J. Woeginger, Core stability in hedonic coalition formation, in: Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 13, 2013, pp. 33\u201350.","DOI":"10.1007\/978-3-642-35843-2_4"},{"key":"10.1016\/j.cosrev.2025.100835_b97","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ipl.2008.10.003","article-title":"Geometric stable roommates","volume":"109","author":"Arkin","year":"2009","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.cosrev.2025.100835_b98","unstructured":"J. Chen, S. Roy, Multi-dimensional stable roommates in 2-dimensional Euclidean space, in: Proceedings of the 30th Annual European Symposium on Algorithms, ESA \u201922, 2022, pp. 36:1\u201336:16."},{"key":"10.1016\/j.cosrev.2025.100835_b99","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10458-020-09470-x","article-title":"Stable roommate with narcissistic, single-peaked, and single-crossing preferences","volume":"34","author":"Bredereck","year":"2020","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.cosrev.2025.100835_b100","doi-asserted-by":"crossref","unstructured":"R. Bredereck, K. Heeger, D. Knop, R. Niedermeier, Multidimensional stable roommates with master list, in: Proceedings of the 16th International Conference on Web and Internet Economics, WINE \u201920, 2020, pp. 59\u201373.","DOI":"10.1007\/978-3-030-64946-3_5"},{"key":"10.1016\/j.cosrev.2025.100835_b101","doi-asserted-by":"crossref","unstructured":"C. Levinger, N. Hazon, S. Simola, A. Azaria, Coalition formation with bounded coalition size, in: Proceedings of the 23nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201924, 2024, pp. 1119\u20131127.","DOI":"10.65109\/VOAT3918"},{"key":"10.1016\/j.cosrev.2025.100835_b102","doi-asserted-by":"crossref","unstructured":"V. Bil\u00f2, G. Monaco, L. Moscardelli, Hedonic games with fixed-size coalitions, in: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI \u201922, 2022, pp. 9287\u20139295.","DOI":"10.1609\/aaai.v36i9.21156"},{"key":"10.1016\/j.cosrev.2025.100835_b103","doi-asserted-by":"crossref","unstructured":"L. Li, E. Micha, A. Nikolov, N. Shah, Partitioning friends fairly, in: Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI \u201923, 2023, pp. 5747\u20135754.","DOI":"10.1609\/aaai.v37i5.25713"},{"key":"10.1016\/j.cosrev.2025.100835_b104","doi-asserted-by":"crossref","unstructured":"T. Hanaka, H. Kiya, Y. Maei, H. Ono, Computational complexity of hedonic games on sparse graphs, in: Proceedings of the 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 19, 2019, pp. 576\u2013584.","DOI":"10.1007\/978-3-030-33792-6_43"},{"key":"10.1016\/j.cosrev.2025.100835_b105","doi-asserted-by":"crossref","unstructured":"M. Bullinger, Pareto-optimality in cardinal hedonic games, in: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201920, 2020, pp. 213\u2013221.","DOI":"10.65109\/XMPQ8486"},{"key":"10.1016\/j.cosrev.2025.100835_b106","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2020.103357","article-title":"Price of pareto optimality in hedonic games","volume":"288","author":"Elkind","year":"2020","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cosrev.2025.100835_b107","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1613\/jair.1.13470","article-title":"Finding and recognizing popular coalition structures","volume":"74","author":"Brandt","year":"2022","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.cosrev.2025.100835_b108","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s11238-006-9022-2","article-title":"On myopic stability concepts for hedonic games","volume":"62","author":"Sung","year":"2007","journal-title":"Theory and Decision"},{"key":"10.1016\/j.cosrev.2025.100835_b109","unstructured":"M. Bullinger, Boundaries to single-agent stability in additively separable hedonic games, in: Proceedings of the 47nd International Symposium on Mathematical Foundations of Computer Science, MFCS \u201922, 2022, pp. 26:1\u201326:15."},{"key":"10.1016\/j.cosrev.2025.100835_b110","doi-asserted-by":"crossref","unstructured":"N. Barrot, M. Yokoo, Stable and envy-free partitions in hedonic games., in: IJCAI, 2019, pp. 67\u201373.","DOI":"10.24963\/ijcai.2019\/10"},{"key":"10.1016\/j.cosrev.2025.100835_b111","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/s00453-009-9326-z","article-title":"Parameterized complexity and local search approaches for the stable marriage problem with ties","volume":"58","author":"Marx","year":"2010","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2025.100835_b112","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.disopt.2010.07.004","article-title":"Stable assignment with couples: Parameterized complexity and local search","volume":"8","author":"Marx","year":"2011","journal-title":"Discrete Optim."},{"key":"10.1016\/j.cosrev.2025.100835_b113","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2018.03.015","article-title":"Parameterized algorithms for stable matching with ties and incomplete lists","volume":"723","author":"Adil","year":"2018","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b114","unstructured":"J. Chen, D. Hermelin, M. Sorge, H. Yedidsion, How hard is it to satisfy (almost) all roommates?, in: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP \u201918, 2018, pp. 35:1\u201335:15."},{"key":"10.1016\/j.cosrev.2025.100835_b115","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.tcs.2021.05.015","article-title":"Balanced stable marriage: How close is close enough?","volume":"883","author":"Gupta","year":"2021","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b116","unstructured":"J. Chen, Computational Complexity of Stable Marriage and Stable Roommates and their Variants, Technical Report, 2019, arXiv:1904.08196."},{"key":"10.1016\/j.cosrev.2025.100835_b117","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.tcs.2020.08.017","article-title":"Solving hard stable matching problems involving groups of similar agents","volume":"844","author":"Meeks","year":"2020","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cosrev.2025.100835_b118","doi-asserted-by":"crossref","unstructured":"R. Bredereck, J. Chen, D. Knop, J. Luo, R. Niedermeier, Adapting stable matchings to evolving preferences, in: Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI \u201920, 2020, pp. 1830\u20131837.","DOI":"10.1609\/aaai.v34i02.5550"},{"key":"10.1016\/j.cosrev.2025.100835_b119","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/19M130491X","article-title":"On treewidth and stable marriage: Parameterized algorithms and hardness results (complete characterization)","volume":"36","author":"Gupta","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.cosrev.2025.100835_b120","doi-asserted-by":"crossref","unstructured":"J. Chen, I. Schlotter, S. Simola, Parameterized algorithms for optimal refugee resettlement, in: Proceedings of the 27th European Conference on Artificial Intelligence, ECAI \u201924, 2024, pp. 3413\u20133420.","DOI":"10.3233\/FAIA240892"},{"key":"10.1016\/j.cosrev.2025.100835_b121","unstructured":"J. Chen, S. Roy, S. Simola, FPT-Approximability of Stable Matching Problems, Technical Report, 2025, arXiv:2508.10129."},{"key":"10.1016\/j.cosrev.2025.100835_b122","unstructured":"B. Bliem, R. Bredereck, R. Niedermeier, Complexity of efficient and envy-free resource allocation: Few agents, resources, or utility levels, in: Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI \u201916, 2016, pp. 102\u2013108."},{"key":"10.1016\/j.cosrev.2025.100835_b123","doi-asserted-by":"crossref","unstructured":"A. Deligkas, E. Eiben, R. Ganian, T. Hamm, S. Ordyniak, The parameterized complexity of connected fair division, in: Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI \u201921, 2021, pp. 139\u2013145.","DOI":"10.24963\/ijcai.2021\/20"},{"key":"10.1016\/j.cosrev.2025.100835_b124","series-title":"43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"14:1","article-title":"Parameterized complexity of incomplete connected fair division","author":"Gahlawat","year":"2023"},{"key":"10.1016\/j.cosrev.2025.100835_b125","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103826","article-title":"Parameterized complexity of envy-free resource allocation in social networks","volume":"315","author":"Eiben","year":"2023","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cosrev.2025.100835_b126","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103664","article-title":"Envy-free allocations respecting social networks","volume":"305","author":"Bredereck","year":"2022","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cosrev.2025.100835_b127","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.dam.2023.05.011","article-title":"Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective","volume":"337","author":"Limaye","year":"2023","journal-title":"Discrete Appl. Math."}],"container-title":["Computer Science Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157401372500111X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157401372500111X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T07:24:09Z","timestamp":1777620249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157401372500111X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":127,"alternative-id":["S157401372500111X"],"URL":"https:\/\/doi.org\/10.1016\/j.cosrev.2025.100835","relation":{},"ISSN":["1574-0137"],"issn-type":[{"value":"1574-0137","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computational Social Choice: Parameterized complexity and challenges","name":"articletitle","label":"Article Title"},{"value":"Computer Science Review","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cosrev.2025.100835","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"100835"}}