{"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":1748585401427,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"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_30","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"505-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Group Manipulation in Facility Location Problems"],"prefix":"10.1007","author":[{"given":"Xin","family":"Sui","sequence":"first","affiliation":[]},{"given":"Craig","family":"Boutilier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s00355-009-0374-8","volume":"33","author":"M\u00c1 Ballester","year":"2009","unstructured":"Ballester, M.\u00c1., Rey-Biel, P.: Does uncertainty lead to sincerity? simple and complex voting mechanisms. Soc. Choice Welf. 33(3), 477\u2013494 (2009)","journal-title":"Soc. Choice Welf."},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1006\/jeth.1993.1069","volume":"61","author":"S Barber\u00e0","year":"1993","unstructured":"Barber\u00e0, S., Gul, F., Stacchetti, E.: Generalized median voter schemes and committees. J. Econ. Theory 61(2), 262\u2013289 (1993)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi III","year":"1989","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"1","key":"30_CR4","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":"30_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"30_CR7","unstructured":"Conitzer, V., Sandholm, V.: Nonexistence of voting rules that are usually hard to manipulate. In: Proceedings of the Twenty-first National Conference on Artificial Intelligence (AAAI 2006), pp. 627\u2013634, Boston (2006)"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3), 1\u201333 (2007)","journal-title":"J. ACM"},{"key":"30_CR9","unstructured":"Erd\u00e9lyi, G., Lackner, M., Pfandler, A.: The complexity of nearly single-peaked consistency. In: Proceedings of the Fourth International Workshop on Computational Social Choice (COMSOC 2012), Krak\u00f3w, Poland (2012)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI 2008), Patras, Greece, pp. 366\u2013370 (2008)","DOI":"10.3233\/978-1-58603-891-5-366"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of manipulative attacks in nearly single-peaked electorates. In: Proceedings of the Thirteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2011), Groningen, The Netherlands, pp. 228\u2013237 (2011)","DOI":"10.1145\/2000378.2000406"},{"key":"30_CR12","doi-asserted-by":"crossref","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. In: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 118\u2013127. ACM (2009)","DOI":"10.1145\/1562814.1562832"},{"issue":"4","key":"30_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Procaccia, A.D.: AI\u2019s war on manipulation: are we winning? AI Mag. 31(4), 53\u201364 (2010)","journal-title":"AI Mag."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Friedgut, E., Kalai, G., Nisan, N.: Elections can be manipulated often. In: Proceedings of the 49th Annual IEEE Symposium on the Foundations of Computer Science (FOCS 2008), Philadelphia, pp. 243\u2013249 (2008)","DOI":"10.1109\/FOCS.2008.87"},{"key":"30_CR15","unstructured":"Galand, L., Cornaz, D., Spanjaard, O.: Bounded single-peaked width and proportional representation. In: Proceedings of the Fourth International Workshop on Computational Social Choice (COMSOC 2012), Krak\u00f3w, Poland (2012)"},{"issue":"4","key":"30_CR16","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: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-73133-7_7","volume-title":"Statistical Network Analysis: Models, Issues, and New Directions","author":"IC Gormley","year":"2007","unstructured":"Gormley, I.C., Murphy, T.B.: A latent space model for rank data. In: Airoldi, E.M., Blei, D.M., Fienberg, S.E., Goldenberg, A., Xing, E.P., Zheng, A.X. (eds.) ICML 2006. LNCS, vol. 4503, pp. 90\u2013102. Springer, Heidelberg (2007)"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica 41, 617\u2013631 (1973)","journal-title":"Econometrica"},{"issue":"2","key":"30_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00493-012-2704-1","volume":"32","author":"M Isaksson","year":"2012","unstructured":"Isaksson, M., Kindler, G., Mossel, E.: The geometry of manipulationa quantitative proof of the gibbard-satterthwaite theorem. Combinatorica 32(2), 221\u2013250 (2012)","journal-title":"Combinatorica"},{"key":"30_CR20","unstructured":"Lu, T., Tang, P., Procaccia, A.D., Boutilier, C.: Bayesian vote manipulation: optimal strategies and impact on welfare. In: Proceedings of the Twenty-eighth Conference on Uncertainty in Artificial Intelligence (UAI 2012), Catalina, CA, pp. 543\u2013553 (2012)"},{"issue":"2","key":"30_CR21","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1111\/j.1468-0262.2004.00499.x","volume":"72","author":"D Majumdar","year":"2004","unstructured":"Majumdar, D., Sen, A.: Ordinally Bayesian incentive compatible voting rules. Econometrica 72(2), 523\u2013540 (2004)","journal-title":"Econometrica"},{"key":"30_CR22","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, New York (1995)"},{"issue":"1","key":"30_CR23","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"30_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"issue":"2","key":"30_CR25","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2307\/2111172","volume":"29","author":"KT Poole","year":"1985","unstructured":"Poole, K.T., Rosenthal, H.: A spatial model for legislative roll call analysis. Am. J. Polit. Sci. 29(2), 357\u2013384 (1985)","journal-title":"Am. J. Polit. Sci."},{"key":"30_CR26","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. 28, 157\u2013181 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and Arrow\u2019s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10, 187\u2013217 (1975)","journal-title":"Journal of Economic Theory"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1017\/CBO9780511800481.012","volume-title":"Algorithmic Game Theory","author":"J Schummer","year":"2007","unstructured":"Schummer, J., Vohra, R.V.: Mechanism design without money. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 243\u2013265. Cambridge University Press, Cambridge (2007)"},{"key":"30_CR29","unstructured":"Sui, X., Boutilier, C., Sandholm, T.: Analysis and optimization of multi-dimensional percentile mechanisms. In: Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing (2013)"},{"key":"30_CR30","unstructured":"Sui, X., Francois-Nienaber, A., Boutilier, C.: Multi-dimensional single-peaked consistency and its approximations. In: Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI 2013), Beijing (2013)"},{"issue":"1","key":"30_CR31","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8\u201337 (1961)","journal-title":"J. Finance"},{"key":"30_CR32","unstructured":"Walsh, T.: Where are the really hard manipulation problems? the phase transition in manipulating the veto rule. In: Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, CA, pp. 324\u2013329 (2009)"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V.: A sufficient condition for voting rules to be frequently manipulable. In: Proceedings of the Ninth ACM Conference on Electronic Commerce (EC 2008), Chicago, pp. 99\u2013108 (2008)","DOI":"10.1145\/1386790.1386810"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:33:31Z","timestamp":1748583211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_30","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"}}]}}