{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:41:03Z","timestamp":1775752863610,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10458-018-9392-1","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T03:48:49Z","timestamp":1528688929000},"page":"672-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["How hard is it to control a group?"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-6818","authenticated-orcid":false,"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[]},{"given":"Dinko","family":"Dimitrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"9392_CR1","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., & Walsh, T. (2015). Computational aspects of multi-winner approval voting. In AAMAS (pp. 107\u2013115)."},{"key":"9392_CR2","doi-asserted-by":"crossref","unstructured":"Bartholdi, J. J., III, Tovey, C. A., & Trick, M. A. (1992). How hard is it to control an election? Mathematical and Computer Modelling, 16(8\u20139), 27\u201340.","DOI":"10.1016\/0895-7177(92)90085-Y"},{"key":"9392_CR3","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2010). Computational aspects of approval voting, chap.\u00a010. In Handbook on approval voting (pp. 199\u2013251). Berlin: Springer."},{"issue":"2","key":"9392_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00355-003-0246-6","volume":"23","author":"D Berga","year":"2004","unstructured":"Berga, D., Berganti\u00f1os, G., Mass\u00f3, J., & Neme, A. (2004). Stability and voting by committees with exit. Social Choice and Welfare, 23(2), 229\u2013247.","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"9392_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.3982\/TE2156","volume":"12","author":"WJ Cho","year":"2017","unstructured":"Cho, W. J., & Ju, B. G. (2017). Multinary group identification. Theoretical Economics, 12(2), 513\u2013531.","journal-title":"Theoretical Economics"},{"key":"9392_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S. A. (1971). The complexity of theorem-proving procedures. In STOC (pp. 151\u2013158).","DOI":"10.1145\/800157.805047"},{"key":"9392_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F. V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms. Berlin: Springer."},{"key":"9392_CR8","doi-asserted-by":"crossref","unstructured":"Dimitrov, D. (2011). The social choice approach to group identification. In Consensual processes (pp. 123\u2013134).","DOI":"10.1007\/978-3-642-20533-0_7"},{"issue":"2","key":"9392_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.mathsocsci.2007.06.001","volume":"54","author":"D Dimitrov","year":"2007","unstructured":"Dimitrov, D., Sung, S. C., & Xu, Y. (2007). Procedural group identification. Mathematical Social Sciences, 54(2), 137\u2013146.","journal-title":"Mathematical Social Sciences"},{"key":"9392_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R. G., & Fellows, M. R. (1999). Parameterized complexity. Berlin: Springer."},{"key":"9392_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity. Texts in computer science","author":"RG Downey","year":"2013","unstructured":"Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. Texts in computer science. Berlin: Springer."},{"key":"9392_CR12","unstructured":"Elkind, E., & Lackner, M. (2015) Structure in dichotomous preferences. In IJCAI (pp. 2019\u20132025)."},{"key":"9392_CR13","unstructured":"Erd\u00e9lyi, G., Reger, C., & Yang, Y. (2017). The complexity of bribery and control in group identification. In AAMAS (pp. 1142\u20131150)."},{"key":"9392_CR14","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Reger, C., & Yang, Y. (2017). Complexity of group identification with partial information. In ADT (pp. 182\u2013196).","DOI":"10.1007\/978-3-319-67504-6_13"},{"key":"9392_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2009). Llull and Copeland voting computationally resist bribery and constructive control. Journal of Artificial Intelligence Research, 35, 275\u2013341.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9392_CR16","unstructured":"Faliszewski, P., & Rothe, J. (2016). Control and bribery in voting. In F.\u00a0Brandt, V.\u00a0Conitzer, U.\u00a0Endriss, J.\u00a0Lang, & A.\u00a0Procaccia (Eds.), Handbook of computational social choice (Chap.\u00a07, pp. 146\u2013168). Cambridge: Cambridge University Press."},{"key":"9392_CR17","unstructured":"Faliszewski, P., Slinko, A., & Talmon, N. (2017). The complexity of multiwinner voting rules with variable number of winners. \n                    arXiv:1711.06641"},{"issue":"1","key":"9392_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00163773","volume":"36","author":"PC Fishburn","year":"1981","unstructured":"Fishburn, P. C., & Brams, S. J. (1981). Approval voting, Condorcet\u2019s principle, and runoff elections. Public Choice, 36(1), 89\u2013114.","journal-title":"Public Choice"},{"issue":"1","key":"9392_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., & Tardos, \u00c9. (1987). An application of simultaneous Diophantine approximaiton in combinatorial optimazation. Combinatorica, 7(1), 49\u201365.","journal-title":"Combinatorica"},{"key":"9392_CR20","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman."},{"key":"9392_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T. F. (1985). Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38, 293\u2013306.","journal-title":"Theoretical Computer Science"},{"issue":"5\u20136","key":"9392_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2007). Anyone but him: The complexity of precluding an alternative. Artificial Intelligence, 171(5\u20136), 255\u2013285.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9392_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.mathsocsci.2007.04.007","volume":"54","author":"N Houy","year":"2007","unstructured":"Houy, N. (2007). \u201cI want to be a J!\u201d: Liberalism in group identification problems. Mathematical Social Sciences, 54(1), 59\u201370.","journal-title":"Mathematical Social Sciences"},{"issue":"3","key":"9392_CR24","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R. (1987). Minkowski\u2019s convex body theorem and integer programming. Mathematics of Operations Research, 12(3), 415\u2013440.","journal-title":"Mathematics of Operations Research"},{"issue":"160","key":"9392_CR25","first-page":"385","volume":"40","author":"A Kasher","year":"1997","unstructured":"Kasher, A., & Rubinstein, A. (1997). On the question \u201cWho is a J?\u201d A social choice approach. Logique & Analyse, 40(160), 385\u2013395.","journal-title":"Logique & Analyse"},{"issue":"2","key":"9392_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11238-016-9535-2","volume":"81","author":"DM Kilgour","year":"2016","unstructured":"Kilgour, D. M. (2016). Approval elections with a variable number of winners. Theory and Decision, 81(2), 199\u2013211.","journal-title":"Theory and Decision"},{"key":"9392_CR27","first-page":"305","volume-title":"Electoral systems, studies in choice and welfare","author":"DM Kilgour","year":"2012","unstructured":"Kilgour, D. M., & Marshall, E. (2012). Approval balloting for fixed-size committees. In D. S. Felsenthal & M. Machover (Eds.), Electoral systems, studies in choice and welfare (pp. 305\u2013326). Berlin: Springer."},{"key":"9392_CR28","volume-title":"Handbook on approval voting","year":"2010","unstructured":"Laslier, J. F., & Sanver, M. R. (Eds.). (2010). Handbook on approval voting. Berlin: Springer."},{"issue":"4","key":"9392_CR29","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H. W. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"9392_CR30","first-page":"212","volume":"2","author":"AP Lin","year":"2011","unstructured":"Lin, A. P. (2011). The complexity of manipulating \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -approval elections. ICAART, 2, 212\u2013218. \n                    arXiv:1005.4159\n                    \n                  .","journal-title":"ICAART"},{"key":"9392_CR31","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A. D., Rosenschein, J. S., & Zohar, A. (2008). Complexity of strategic behavior in multi-winner elections. Journal of Artificial Intelligence Research, 33, 149\u2013178.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"9392_CR32","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.geb.2007.08.006","volume":"63","author":"AD Miller","year":"2008","unstructured":"Miller, A. D. (2008). Group identification. Games and Economic Behavior, 63(1), 188\u2013202.","journal-title":"Games and Economic Behavior"},{"key":"9392_CR33","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R. (2006). Invitation to fixed-parameter algorithms. Oxford: Oxford University Press Inc."},{"issue":"2","key":"9392_CR34","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0022-0531(03)00080-2","volume":"110","author":"D Samet","year":"2003","unstructured":"Samet, D., & Schmeidler, D. (2003). Between liberalism and democracy. Journal of Economic Theory, 110(2), 213\u2013233.","journal-title":"Journal of Economic Theory"},{"key":"9392_CR35","volume-title":"Introduction to graph theory","author":"DB West","year":"2000","unstructured":"West, D. B. (2000). Introduction to graph theory. Englewood Cliffs: Prentice-Hall."},{"key":"9392_CR36","unstructured":"Yang, Y., & Guo, J. (2014). Controlling elections with bounded single-peaked width. In AAMAS (pp. 629\u2013636)."},{"key":"9392_CR37","unstructured":"Yang, Y., & Guo, J. (2015). How hard is control in multi-peaked elections: A parameterized study. In AAMAS (pp. 1729\u20131730)."},{"key":"9392_CR38","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.jcss.2017.06.004","volume":"89","author":"Y Yang","year":"2017","unstructured":"Yang, Y., & Guo, J. (2017). The control complexity of \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  -approval: From the single-peaked case to the general case. Journal of Computer and System Sciences, 89, 432\u2013449.","journal-title":"Journal of Computer and System Sciences"},{"key":"9392_CR39","doi-asserted-by":"crossref","unstructured":"Yang, Y., Wang, J. (2018). Multiwinner voting with restricted admissible sets: Complexity and strategyproofness. In IJCAI (to appear).","DOI":"10.24963\/ijcai.2018\/80"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-018-9392-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-018-9392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:14:14Z","timestamp":1560194054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-018-9392-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9392"],"URL":"https:\/\/doi.org\/10.1007\/s10458-018-9392-1","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"11 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}