{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:31:44Z","timestamp":1786980704238,"version":"build-2736575974"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702557"],"award-info":[{"award-number":["61702557"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2017M612584"],"award-info":[{"award-number":["2017M612584"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["ER 738\/2-1"],"award-info":[{"award-number":["ER 738\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["ER 738\/2-2"],"award-info":[{"award-number":["ER 738\/2-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10458-019-09427-9","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T09:02:51Z","timestamp":1575882171000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The complexity of bribery and control in group identification"],"prefix":"10.1007","volume":"34","author":[{"given":"G\u00e1bor","family":"Erd\u00e9lyi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Reger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-6818","authenticated-orcid":false,"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"issue":"1","key":"9427_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00355-013-0766-7","volume":"43","author":"JCR Alcantud","year":"2014","unstructured":"Alcantud, J. C. R., & Laruelle, A. (2014). Dis&approval voting: A characterization. Social Choice and Welfare, 43(1), 1\u201310.","journal-title":"Social Choice and Welfare"},{"key":"9427_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, F. A., Procaccia, A. D., & Tennenholtz, M. (2011). Sum of us: Strategyproof selection from the selectors. In Proceedings of the 13th conference on theoretical aspects of rationality and knowledge (TARK) (pp. 101\u2013110).","DOI":"10.1145\/2000378.2000390"},{"key":"9427_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: A modern approach","author":"S Arora","year":"2009","unstructured":"Arora, S., & Barak, B. (2009). Computational complexity: A modern approach. Cambridge: Cambridge University Press."},{"key":"9427_CR4","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., & Walsh, T. (2015). Computational aspects of multi-winner approval voting. In Proceedings of the 14th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 107\u2013115)."},{"key":"9427_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lev, O., Mattei, N., Rosenschein, J. S., & Walsh, T. (2016). Strategyproof peer selection: Mechanisms, analyses, and experiments. In Proceedings of the 30th AAAI conference on artificial intelligence (AAAI) (pp. 397\u2013403).","DOI":"10.1609\/aaai.v30i1.10038"},{"key":"9427_CR6","volume-title":"Digraphs\u2014Theory. Algorithms and applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., & Gutin, G. (2008). Digraphs\u2014Theory. Algorithms and applications. Berlin: Springer."},{"issue":"3","key":"9427_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi, J, I. I. I., Tovey, C., & Trick, M. (1989). The computational difficulty of manipulating an election. Social Choice and Welfare, 6(3), 227\u2013241.","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"9427_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi, J, I. I. I., Tovey, C., & Trick, M. (1989). Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6(2), 157\u2013165.","journal-title":"Social Choice and Welfare"},{"issue":"8\/9","key":"9427_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi, J, I. I. I., Tovey, C., & Trick, M. (1992). How hard is it to control an election? Mathematical and Computer Modeling, 16(8\/9), 27\u201340.","journal-title":"Mathematical and Computer Modeling"},{"key":"9427_CR10","unstructured":"Baumeister, D., & Dennisen, S. (2015). Voter dissatisfaction in committee elections. In Proceedings of the 14th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 1707\u20131708)."},{"key":"9427_CR11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.mathsocsci.2015.03.006","volume":"76","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O., & Rothe, J. (2015). Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Mathematical Social Sciences, 76, 19\u201330.","journal-title":"Mathematical Social Sciences"},{"key":"9427_CR12","first-page":"361","volume":"6","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O., & Rothe, J. (2015). Judgment Aggregation. Economics and Computation, 6, 361\u2013391.","journal-title":"Economics and Computation"},{"key":"9427_CR13","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Hogrebe, T., & Rey, L. (2019). Generalized distance bribery. In Proceedings of the 33rd AAAI conference on artificial intelligence (AAAI) (pp. 1764\u20131771).","DOI":"10.1609\/aaai.v33i01.33011764"},{"issue":"2","key":"9427_CR14","doi-asserted-by":"crossref","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"},{"key":"9427_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disopt.2013.10.003","volume":"11","author":"D Binkele-Raible","year":"2014","unstructured":"Binkele-Raible, D., Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., & Rothe, J. (2014). The complexity of probabilistic lobbying. Discrete Optimization, 11, 1\u201321.","journal-title":"Discrete Optimization"},{"issue":"3","key":"9427_CR16","doi-asserted-by":"crossref","first-page":"831","DOI":"10.2307\/1955105","volume":"72","author":"S Brams","year":"1978","unstructured":"Brams, S., & Fishburn, P. (1978). Approval voting. American Political Science Review, 72(3), 831\u2013847.","journal-title":"American Political Science Review"},{"key":"9427_CR17","volume-title":"Handbook of computational social choice","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., & Procaccia, A. (Eds.). (2016). Handbook of computational social choice. Cambridge: Cambridge University Press."},{"key":"9427_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1613\/jair.4285","volume":"50","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Such\u00fd, O., et al. (2014). A multivariate complexity analysis of lobbying in multiple referenda. Journal of Artificial Intelligence Research, 50, 409\u2013446.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9427_CR19","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Kaczmarczyk, A., & Niedermeier, R. (2017). On coalitional manipulation for multiwinner elections: Shortlisting. In Proceedings of the 26th international joint conference on artificial intelligence (IJCAI) (pp. 887\u2013893).","DOI":"10.24963\/ijcai.2017\/123"},{"key":"9427_CR20","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s11238-008-9098-y","volume":"68","author":"MA Cengelci","year":"2010","unstructured":"Cengelci, M. A., & Sanver, M. R. (2010). Simple collective identity functions. Theory and Decision, 68, 417\u2013443.","journal-title":"Theory and Decision"},{"issue":"3","key":"9427_CR21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., & Slinko, A. (2007). On complexity of lobbying in multiple referenda. Review of Economic Design, 11(3), 217\u2013224.","journal-title":"Review of Economic Design"},{"key":"9427_CR22","first-page":"123","volume-title":"The social choice approach to group identification. Consensual processes","author":"D Dimitrov","year":"2011","unstructured":"Dimitrov, D. (2011). The social choice approach to group identification. Consensual processes (pp. 123\u2013134). Berlin: Springer."},{"issue":"2","key":"9427_CR23","doi-asserted-by":"crossref","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"},{"issue":"3","key":"9427_CR24","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., & Slinko, A. (2017). Properties of multiwinner voting rules. Social Choice and Welfare, 48(3), 599\u2013632.","journal-title":"Social Choice and Welfare"},{"key":"9427_CR25","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., & Slinko, A. M. (2009). Swap bribery. In Proceedings of the 2nd international symposim on algorithmic game theory (SAGT) (pp. 299\u2013310).","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"9427_CR26","unstructured":"Elkind, E., Lang, J., & Saffidine, A. (2011). Choosing collectively optimal sets of alternatives based on the condorcet criterion. In Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI) (pp. 186\u2013191)."},{"key":"9427_CR27","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Hemaspaandra, E., & Hemaspaandra, L. A. (2015). More natural models of electoral control by partition. In Proceedings of the 4th international conference on algorithmic decision theory (ADT) (pp. 396\u2013413).","DOI":"10.1007\/978-3-319-23114-3_24"},{"key":"9427_CR28","unstructured":"Erd\u00e9lyi, G., Reger, C., & Yang, Y. (2017). The complexity of bribery and control in group identification. In Proceedings of the 16th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 1142\u20131150)."},{"issue":"3","key":"9427_CR29","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0204034","volume":"4","author":"S Even","year":"1975","unstructured":"Even, S. (1975). An algorithm for determining whether the connectivity of a graph is at least $$k$$. SIAM Journal on Computing, 4(3), 393\u2013396.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"9427_CR30","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S Even","year":"1975","unstructured":"Even, S., & Tarjan, R. E. (1975). Network flow and testing graph connectivity. SIAM Journal on Computing, 4(4), 507\u2013518.","journal-title":"SIAM Journal on Computing"},{"key":"9427_CR31","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2009). How hard is bribery in elections? Journal of Artificial Intelligence Research, 35, 485\u2013532.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9427_CR32","unstructured":"Faliszewski, P., Slinko, A., & Talmon, N. (2017). 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) (pp. 6\u201314)."},{"key":"9427_CR33","unstructured":"Faliszewski, P., Slinko, A., & Talmon, N. (2017). The complexity of multiwinner voting rules with variable number of winners. arXiv:1711.06641."},{"issue":"3","key":"9427_CR34","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0141041","volume":"41","author":"P Fishburn","year":"1981","unstructured":"Fishburn, P. (1981). An analysis of simple voting systems for electing committees. SIAM Journal on Applied Mathematics, 41(3), 499\u2013502.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"9427_CR35","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."},{"issue":"3","key":"9427_CR36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0165-4896(85)90043-5","volume":"10","author":"W Gehrlein","year":"1985","unstructured":"Gehrlein, W. (1985). The condorcet criterion and committee selection. Mathematical Social Sciences, 10(3), 199\u2013209.","journal-title":"Mathematical Social Sciences"},{"issue":"3","key":"9427_CR37","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s00355-019-01194-6","volume":"53","author":"S Gonzalez","year":"2019","unstructured":"Gonzalez, S., Laruelle, A., & Solal, P. (2019). Dilemma with approval and disapproval votes. Social Choice and Welfare, 53(3), 497\u2013517.","journal-title":"Social Choice and Welfare"},{"key":"9427_CR38","doi-asserted-by":"crossref","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":"9427_CR39","doi-asserted-by":"crossref","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":"3","key":"9427_CR40","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10458-019-09403-3","volume":"33","author":"A Kaczmarczyk","year":"2019","unstructured":"Kaczmarczyk, A., & Faliszewski, P. (2019). Algorithms for destructive shift bribery. Autonomous Agents and Multi-Agent Systems, 33(3), 275\u2013297.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9427_CR41","first-page":"56","volume-title":"Jewish identity","author":"A Kasher","year":"1993","unstructured":"Kasher, A. (1993). Jewish collective identity. In D. T. Goldberg & M. Krausz (Eds.), Jewish identity (Vol. 4, pp. 56\u201378). Philadelphia: Temple University Press."},{"key":"9427_CR42","first-page":"385","volume":"60","author":"A Kasher","year":"1997","unstructured":"Kasher, A., & Rubinstein, A. (1997). On the question \u201cWho is a J?\u201d, a social choice approach. Logique et Analyse, 60, 385\u2013395.","journal-title":"Logique et Analyse"},{"key":"9427_CR43","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-35605-3_6","volume-title":"Mathematics and democracy: Voting systems and collective choice","author":"D Kilgour","year":"2006","unstructured":"Kilgour, D., Brams, S., & Sanver, R. (2006). How to elect a representative committee using approval balloting. In F. Pukelsheim & B. Simeone (Eds.), Mathematics and democracy: Voting systems and collective choice (pp. 83\u201395). Berlin: Springer."},{"issue":"2","key":"9427_CR44","doi-asserted-by":"crossref","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"},{"issue":"2","key":"9427_CR45","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J. M., & Yannakakis, M. (1980). The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2), 219\u2013230.","journal-title":"Journal of Computer and System Sciences"},{"key":"9427_CR46","doi-asserted-by":"crossref","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":"9427_CR47","doi-asserted-by":"crossref","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":"9427_CR48","doi-asserted-by":"crossref","unstructured":"Nehama, I. (2015). Complexity of optimal lobbying in threshold aggregation. In Proceedings of the 4th international conference on algorithmic decision theory (ADT) (pp. 379\u2013395).","DOI":"10.1007\/978-3-319-23114-3_23"},{"key":"9427_CR49","unstructured":"Obraztsova, S., Zick, Y., & Elkind, E. (2013). On manipulation in multi-winner elections based on scoring rules. In Proceedings of the 12th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 359\u2013366)."},{"issue":"3","key":"9427_CR50","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s00355-003-0209-y","volume":"21","author":"T Ratliff","year":"2003","unstructured":"Ratliff, T. (2003). Some startling inconsistencies when electing committees. Social Choice and Welfare, 21(3), 433\u2013454.","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"9427_CR51","doi-asserted-by":"crossref","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"},{"issue":"3","key":"9427_CR52","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/inte.32.3.30.39","volume":"32","author":"CA Tovey","year":"2002","unstructured":"Tovey, C. A. (2002). Tutorial on computational complexity. Interfaces, 32(3), 30\u201361.","journal-title":"Interfaces"},{"key":"9427_CR53","volume-title":"Introduction to graph theory","author":"DB West","year":"2000","unstructured":"West, D. B. (2000). Introduction to graph theory. Upper Saddle River: Prentice-Hall."},{"key":"9427_CR54","doi-asserted-by":"crossref","unstructured":"Xia, L. (2012). Computing the margin of victory for various voting rules. In Proceedings of the 13th acm conference on electronic commerce (ACM-EC) (pp. 982\u2013999).","DOI":"10.1145\/2229012.2229086"},{"key":"9427_CR55","unstructured":"Xia, L., Zuckerman, M., Procaccia, A., Conitzer, V., & Rosenschein, J. (2009). Complexity of unweighted coalitional manipulation under some common voting rules. In Proceedings of the 21st international joint conference on artificial intelligence (IJCAI) (pp. 348\u2013353)."},{"issue":"5","key":"9427_CR56","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/s10458-018-9392-1","volume":"32","author":"Y Yang","year":"2018","unstructured":"Yang, Y., & Dimitrov, D. (2018). How hard is it to control a group? Autonomous Agents and Multi-Agent Systems, 32(5), 672\u2013692.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9427_CR57","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.tcs.2018.08.013","volume":"760","author":"Y Yang","year":"2019","unstructured":"Yang, Y., Shrestha, Y. R., & Guo, J. (2019). On the complexity of bribery with distance restrictions. Theoretical Computer Science, 760, 55\u201371.","journal-title":"Theoretical Computer Science"},{"key":"9427_CR58","doi-asserted-by":"crossref","unstructured":"Yang, Y., & Wang, J. (2018). Multiwinner voting with restricted admissible sets: Complexity and strategyproofness. In Proceedings of the 27th international joint conference on artificial intelligence (IJCAI) (pp. 576\u2013582).","DOI":"10.24963\/ijcai.2018\/80"},{"key":"9427_CR59","doi-asserted-by":"crossref","unstructured":"Yang, Y. (2019). Complexity of manipulating and controlling approval-based multiwinner voting. In Proceedings of the 28th international joint conference on artificial intelligence (IJCAI) (pp. 637\u2013643).","DOI":"10.24963\/ijcai.2019\/90"},{"key":"9427_CR60","unstructured":"Zhou, A., Yang, Y., & Guo, J. (2019). Parameterized complexity of committee elections with dichotomous and trichotomous votes. In Proceedings of the 18th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 503\u2013510)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09427-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-019-09427-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09427-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T20:47:20Z","timestamp":1665175640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-019-09427-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9427"],"URL":"https:\/\/doi.org\/10.1007\/s10458-019-09427-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"9 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"8"}}