{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T06:10:01Z","timestamp":1748585401886,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"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_5","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"71-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Manipulation of k-Approval in Nearly Single-Peaked Electorates"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Erd\u00e9lyi","sequence":"first","affiliation":[]},{"given":"Martin","family":"Lackner","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pfandler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.A.: Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 715\u2013722. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7637"},{"key":"5_CR4","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: Are there any nicely structured preference profiles nearby? In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pp. 62\u201368. AAAI Press (2013)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM vol. 54(3), Article 14 (2007)","DOI":"10.1145\/1236457.1236461"},{"key":"5_CR6","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Bounded single-peaked width and proportional representation. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012). Frontiers in Artificial Intelligence and Applications, vol. 242, pp. 270\u2013275. IOS Press (2012)"},{"key":"5_CR7","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). pp. 76\u201382. AAAI Press (2013)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Elkind, E., Lackner, M.: On detecting nearly structured preference profiles. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014). pp. 661\u2013667. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8823"},{"key":"5_CR9","unstructured":"Elkind, E., Lackner, M.: Structure in dichotomous preferences. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). AAAI Press (to appear 2015)"},{"issue":"1\u20134","key":"5_CR10","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":"5_CR11","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Lackner, M., Pfandler, A.: Computational aspects of nearly single-peaked electorates. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI 2013), pp. 283\u2013289. AAAI Press (July 2013)","DOI":"10.1609\/aaai.v27i1.8608"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008). Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 366\u2013370. IOS Press (2008)","DOI":"10.3233\/978-1-58603-891-5-366"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2010.09.001","volume":"209","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2), 89\u2013107 (2011)","journal-title":"Inf. Comput."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.artint.2013.11.004","volume":"207","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207, 69\u201399 (2014)","journal-title":"Artif. Intell."},{"key":"5_CR15","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":"5_CR16","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 (AGENTS 1999), pp. 434\u2013435. ACM Press (1999)","DOI":"10.1145\/301136.301303"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcss.2006.09.002","volume":"73","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.: Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1), 73\u201383 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1613\/jair.2148","volume":"28","author":"AD Procaccia","year":"2007","unstructured":"Procaccia, A.D., Rosenschein, J.S.: Junta distributions and the average-case complexity of manipulating elections. J. Artif. Intell. Res. (JAIR) 28, 157\u2013181 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.: Strategy-proofness and Arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theor. 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theor."},{"key":"5_CR21","unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007). pp. 3\u20138. AAAI Press (2007)"},{"key":"5_CR22","unstructured":"Xia, L.: Designing social choice mechanisms using machine learning. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013), pp. 471\u2013474. International Foundation for Autonomous Agents and Multiagent Systems (2013)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:33:22Z","timestamp":1748583202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_5","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"}}]}}