{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:18Z","timestamp":1759638198019,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_24","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"396-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["More Natural Models of Electoral Control by Partition"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Erd\u00e9lyi","sequence":"first","affiliation":[]},{"given":"Edith","family":"Hemaspaandra","sequence":"additional","affiliation":[]},{"given":"Lane A.","family":"Hemaspaandra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"8\/9","key":"24_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 III, J., 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":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-41575-3_6","volume-title":"Algorithmic Decision Theory","author":"D Baumeister","year":"2013","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O.J., Rothe, J.: Computational aspects of manipulation and control in judgment aggregation. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS, vol. 8176, pp. 71\u201385. Springer, Heidelberg (2013)"},{"key":"24_CR3","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., Talmon, N.: Large-scale election campaigns: combinatorial shift bribery. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 67\u201375. International Foundation for Autonomous Agents and Multiagent Systems, May 2015"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2015.04.023","volume":"589","author":"L Bulteau","year":"2015","unstructured":"Bulteau, L., Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Combinatorial voter control in elections. Theor. Comput. Sci. 589, 99\u2013120 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Elections with few voters: candidate control can be easy. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 2045\u20132051. AAAI Press, January 2015","DOI":"10.1609\/aaai.v29i1.9429"},{"key":"24_CR6","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, March 2001","DOI":"10.1145\/371920.372165"},{"issue":"1\u20134","key":"24_CR7","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."},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.jcss.2014.11.002","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4), 632\u2013660 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1002\/malq.200810020","volume":"55","author":"G Erd\u00e9lyi","year":"2009","unstructured":"Erd\u00e9lyi, G., Nowak, M., Rothe, J.: Sincere-strategy preference-based approval voting fully resists constructive control and broadly resists destructive control. Math. Logic Q. 55(4), 425\u2013443 (2009)","journal-title":"Math. Logic Q."},{"key":"24_CR10","doi-asserted-by":"crossref","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, June 2003","DOI":"10.1145\/872757.872795"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1613\/jair.4621","volume":"52","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Weighted electoral control. J. Artif. Intell. Res. 52, 507\u2013542 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR12","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., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. 35, 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR13","unstructured":"Faliszewski, P., Hemaspaandra, E., Schnoor, H.: Copeland voting: ties matter. In: Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems, pp. 983\u2013990. International Foundation for Autonomous Agents and Multiagent Systems, May 2008"},{"key":"24_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman and Company, New York (1979)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Mundhe, M., Hernandez, K., Sen, S.: Voting for movies: the anatomy of recommender systems. In: Proceedings of the 3rd Annual Conference on Autonomous Agents, pp. 434\u2013435. ACM Press, May 1999","DOI":"10.1145\/301136.301303"},{"key":"24_CR16","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Menton, C.: Search versus decision for election manipulation problems. Technical Report arXiv:1202.6641 [cs.GT], Computing Research Repository, arXiv.org\/corr\/, Febuary 2012. Accessed March 2012. Conference Version available as [17]"},{"key":"24_CR17","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Menton, C.: Search versus decision for election manipulation problems. In: Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science, pp. 377\u2013388. Leibniz International Proceedings in Informatics (LIPIcs), Febuary\/March 2013"},{"issue":"5\u20136","key":"24_CR18","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."},{"issue":"4","key":"24_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2421119.2421135","volume":"43","author":"L Hemaspaandra","year":"2012","unstructured":"Hemaspaandra, L., Williams, R.: An atypical survey of typical-case heuristic algorithms. SIGACT News 43(4), 71\u201389 (2012)","journal-title":"SIGACT News"},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"24_CR21","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D McGarvey","year":"1953","unstructured":"McGarvey, D.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00224-012-9441-0","volume":"53","author":"C Menton","year":"2013","unstructured":"Menton, C.: Normalized range voting broadly resists control. Theory Comput. Syst. 53(4), 507\u2013531 (2013)","journal-title":"Theory Comput. Syst."},{"key":"24_CR23","unstructured":"Menton, C., Singh, P.: Control complexity of Schulze voting. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 286\u2013292. AAAI Press, August 2013"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Parkes, D., Xia, L.: A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1429\u20131435. AAAI Press, August 2012","DOI":"10.1609\/aaai.v26i1.8258"},{"issue":"1\u20133","key":"24_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10472-013-9359-5","volume":"68","author":"J Rothe","year":"2013","unstructured":"Rothe, J., Schend, L.: Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey. Ann. Math. Artif. Intell. 68(1\u20133), 161\u2013193 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"24_CR26","first-page":"1","volume":"42","author":"T Walsh","year":"2011","unstructured":"Walsh, T.: Where are the hard manipulation problems? J. Artif. Intell. Res. 42, 1\u201329 (2011)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T12:52:19Z","timestamp":1691931139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}