{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T04:27:31Z","timestamp":1729052851790},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031739026","type":"print"},{"value":"9783031739033","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-73903-3_1","type":"book-chapter","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:01:53Z","timestamp":1729026113000},"page":"3-17","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of\u00a0Candidate Control for\u00a0Single Nontransferable Vote and\u00a0Bloc Voting"],"prefix":"10.1007","author":[{"given":"Garo","family":"Karh Bet","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0589-3616","authenticated-orcid":false,"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Zorn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,16]]},"reference":[{"issue":"8\/9","key":"1_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi, J., III., Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Model. 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Baumeister, D., Faliszewski, P., Rothe, J., Skowron, P.: Multiwinner voting. In: Rothe, J. (ed.) Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Classroom Companion: Economics, 2nd edn., chap. 6, pp. 403\u2013465. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-60099-9","DOI":"10.1007\/978-3-031-60099-9"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Baumeister, D., Rothe, J.: Preference aggregation by voting. In: Rothe, J. (ed.) Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Classroom Companion: Economics, 2nd edn., chap. 4, pp. 233\u2013367. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-60099-9_4","DOI":"10.1007\/978-3-031-60099-9_4"},{"key":"1_CR4","volume-title":"Handbook of Computational Social Choice","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.): Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"J Chamberlin","year":"1983","unstructured":"Chamberlin, J., Courant, P.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77(3), 718\u2013733 (1983)","journal-title":"Am. Polit. Sci. Rev."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Walsh, T.: Barriers to manipulation in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, chap.\u00a06, pp. 127\u2013145. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.007"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference, pp. 613\u2013622. ACM Press (2001)","DOI":"10.1145\/371920.372165"},{"key":"1_CR8","unstructured":"Ephrati, E., Rosenschein, J.: The Clarke Tax as a consensus mechanism among automated agents. In: Proceedings of the 9th National Conference on Artificial Intelligence, pp. 173\u2013178. AAAI Press (1991)"},{"issue":"1\u20134","key":"1_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1018924209812","volume":"20","author":"E Ephrati","year":"1997","unstructured":"Ephrati, E., Rosenschein, J.: A heuristic technique for multi-agent planning. Ann. Math. Artif. Intell. 20(1\u20134), 13\u201367 (1997)","journal-title":"Ann. Math. Artif. Intell."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Neveling, M., Reger, C., Rothe, J., Yang, Y., Zorn, R.: Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. J. Auton. Agents Multi-Agent Syst. 35(2), 41:1\u201341:48 (2021)","DOI":"10.1007\/s10458-021-09523-9"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 301\u2013312. ACM Press (2003). Corrigendum: https:\/\/doi.org\/10.1145\/1376616.1376778","DOI":"10.1145\/1376616.1376778"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, chap.\u00a07, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"key":"1_CR13","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. In: Endriss, U. (ed.) Trends in Computational Social Choice, chap.\u00a02, pp. 27\u201347. AI Access Foundation (2017)"},{"key":"1_CR14","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"issue":"5\u20136","key":"1_CR15","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., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-41392-6_2","volume-title":"Algorithmic Game Theory","author":"J Lang","year":"2013","unstructured":"Lang, J., Maudet, N., Polukarov, M.: New results on equilibria in strategic candidacy. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 13\u201325. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41392-6_2"},{"key":"1_CR17","unstructured":"Loreggia, A.: Iterative voting, control and sentiment analysis. Ph.D. thesis, University of Padova (2016)"},{"key":"1_CR18","unstructured":"Loreggia, A., Narodytska, N., Rossi, F., Venable, B., Walsh, T.: Controlling elections by replacing candidates or votes (extended abstract). In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 1737\u20131738. IFAAMAS (2015)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Maushagen, C., Niclaus, D., N\u00fcsken, P., Rothe, J., Seeger, T.: Toward completing the picture of control in Schulze and ranked pairs elections. In: Proceedings of the 33rd International Joint Conference on Artificial Intelligence. ijcai.org (2024)","DOI":"10.24963\/ijcai.2024\/326"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A., Rosenschein, J., Zohar, A.: Complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149\u2013178 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR21","unstructured":"Pennock, D., Horvitz, E., Giles, C.: Social choice theory and recommender systems: analysis of the axiomatic foundations of collaborative filtering. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 729\u2013734. AAAI Press (2000)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Rothe, J. (ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Classroom Companion: Economics, 2nd edn. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-60099-9"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Yang, Y.: Complexity of manipulating and controlling approval-based multiwinner voting. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 637\u2013643. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/90"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-73903-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:02:11Z","timestamp":1729026131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73903-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9783031739026","9783031739033"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73903-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]},"assertion":[{"value":"16 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/preflib.github.io\/adt2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}