{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:39:01Z","timestamp":1768448341867,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00493-012-2704-1","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:48:05Z","timestamp":1338922085000},"page":"221-250","source":"Crossref","is-referenced-by-count":15,"title":["The geometry of manipulation \u2014 A quantitative proof of the Gibbard-Satterthwaite theorem"],"prefix":"10.1007","volume":"32","author":[{"given":"Marcus","family":"Isaksson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Kindler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elchanan","family":"Mossel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"key":"2704_CR1","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BFb0068322","volume-title":"Seminar on probability, XVII","author":"D. Aldous","year":"1983","unstructured":"D. Aldous: Random walks on finite groups and rapidly mixing Markov chains, in: Seminar on probability, XVII, volume 986 of Lecture Notes in Math., 243\u2013297. Springer, Berlin, 1983."},{"key":"2704_CR2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"K. Arrow","year":"1950","unstructured":"K. Arrow: A difficulty in the theory of social welfare, J. of Political Economy 58 (1950), 328\u2013346.","journal-title":"J. of Political Economy"},{"key":"2704_CR3","unstructured":"K. Arrow: Social choice and individual values. John Wiley and Sons, 1963."},{"key":"2704_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00183045","volume":"84","author":"J. Bartholdi III","year":"1991","unstructured":"J. Bartholdi, III and J. Orline: Single transferrable vote resists strategic voting, Soc. Choice Welf. 8(4) (1991), 341\u2013354.","journal-title":"Soc. Choice Welf"},{"key":"2704_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00303169","volume":"62","author":"J. Bartholdi III","year":"1989","unstructured":"J. Bartholdi, III, C. A. Tovey and M. A. Trick: Voting schemes for which it can be difficult to tell who won the election, Soc. Choice Welf. 6(2) (1989), 157\u2013165.","journal-title":"Soc. Choice Welf"},{"key":"2704_CR6","unstructured":"V. Coniftzer and T. Sandholm: Universal voting protocol tweaks to make manipulation hard, in: Georg Gottlob and Toby Walsh, editors, IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9\u201315, 2003, 781\u2013788. Morgan Kaufmann, 2003."},{"key":"2704_CR7","unstructured":"V. Conitzer and T. Sandholm: Nonexistence of voting rules that are usually hard to manipulate, in: AAAI, AAAI Press, 2006."},{"key":"2704_CR8","doi-asserted-by":"crossref","unstructured":"S. Dobzinski and A. D. Procaccia: Frequent manipulability of elections: The case of two voters, in: Christos H. Papadimitriou and Shuzhong Zhang, editors, Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17\u201320, 2008. Proceedings, volume 5385 of Lecture Notes in Computer Science, 653\u2013664. Springer, 2008.","DOI":"10.1007\/978-3-540-92185-1_71"},{"key":"2704_CR9","doi-asserted-by":"crossref","unstructured":"E. Elkind and H. Lipmaa: Hybrid voting protocols and hardness of manipulation, in: Xiaotie Deng and Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19\u201321, 2005, Proceedings, volume 3827 of Lecture Notes in Computer Science, 206\u2013215. Springer, 2005.","DOI":"10.1007\/11602613_22"},{"key":"2704_CR10","doi-asserted-by":"crossref","unstructured":"P. Faliszewski and A. D. Procaccia: Ai\u2019s war on manipulation: Are we winning? AI Magazine special issue on algorithmic game theory, to appear, 2010.","DOI":"10.1609\/aimag.v31i4.2314"},{"key":"2704_CR11","doi-asserted-by":"crossref","unstructured":"E. Friedgut, G. Kalai and N. Nisan: Elections can be manipulated often, in: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 243\u2013249, 2009.","DOI":"10.1109\/FOCS.2008.87"},{"issue":"4","key":"2704_CR12","doi-asserted-by":"crossref","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A. Gibbard","year":"1973","unstructured":"A. Gibbard: Manipulation of voting schemes: a general result, Econometrica 41(4) (1973), 587\u2013601.","journal-title":"Econometrica"},{"key":"2704_CR13","doi-asserted-by":"crossref","unstructured":"M. Jerrum and A. Sinclair: Polynomial-time approximation algorithms for ising model (extended abstract), in: Automata, Languages and Programming, 462\u2013475, 1990.","DOI":"10.1007\/BFb0032051"},{"key":"2704_CR14","unstructured":"J. S. Kelly: Almost all social choice rules are highly manipulable, but a few aren\u2019t, Social Choice and Welfare 10 (1993)."},{"key":"2704_CR15","doi-asserted-by":"crossref","unstructured":"A. D. Procaccia and J. S. Rosenschein: Junta distributions and the average-case complexity of manipulating elections, in: Hideyuki Nakashima, Michael P. Wellman, Gerhard Weiss, and Peter Stone, editors, 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8\u201312, 2006, 497\u2013504. ACM, 2006.","DOI":"10.1145\/1160633.1160726"},{"key":"2704_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M. A. Satterthwaite","year":"1975","unstructured":"M. A. Satterthwaite: Strategy-proofness and Arrow\u2019s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions, J. of Economic Theory 10 (1975), 187\u2013217.","journal-title":"J. of Economic Theory"},{"key":"2704_CR17","doi-asserted-by":"crossref","unstructured":"D. B. Wilson: Mixing times of lozenge tiling and card shuffling markov chains, Ann. Appl. Probab. 14(1) (2004).","DOI":"10.1214\/aoap\/1075828054"},{"key":"2704_CR18","doi-asserted-by":"crossref","unstructured":"L. Xia and V. Conitzer: A sufficient condition for voting rules to be frequently manipulable, in: Lance Fortnow, John Riedl, and Tuomas Sandholm, editors, Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, June 8\u201312, 2008, 99\u2013108. ACM, 2008.","DOI":"10.1145\/1386790.1386810"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2704-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2704-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2704-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T11:19:40Z","timestamp":1594207180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2704-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["2704"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2704-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}