{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:40:57Z","timestamp":1772509257674,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T00:00:00Z","timestamp":1407196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00493-014-2979-5","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T01:02:40Z","timestamp":1407200560000},"page":"317-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A quantitative Gibbard-Satterthwaite theorem without neutrality"],"prefix":"10.1007","volume":"35","author":[{"given":"Elchanan","family":"Mossel","sequence":"first","affiliation":[]},{"given":"Mikl\u00f3s Z.","family":"R\u00e1cz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,5]]},"reference":[{"key":"2979_CR1","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 Concept of Social Welfare, Journal of Political Economy 58 (1950), 328\u2013346.","journal-title":"Journal of Political Economy"},{"key":"2979_CR2","unstructured":"K. Arrow: Social Choice and Individual Values, Yale University Press, 2nd edition, 19\u20133."},{"key":"2979_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J. J. Bartholdi","year":"1989","unstructured":"J. J. Bartholdi, C. A. Tovey and M. A. Trick: The Computational Difficulty of Manipulating an Election, Social Choice and Welfare 6 (1989), 227\u2013241.","journal-title":"Social Choice and Welfare"},{"key":"2979_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01318906","volume":"180","author":"C. Borell","year":"1982","unstructured":"C. Borell: Positivity improving operators and hypercontractivity, Mathematische Zeitschrift 180 (1982), 225\u2013234.","journal-title":"Mathematische Zeitschrift"},{"key":"2979_CR5","first-page":"627","volume":"21","author":"V. Conitzer","year":"2006","unstructured":"V. Conitzer and T. Sandholm: Nonexistence of Voting Rules That Are Usually Hard to Manipulate, in: Proceedings of the 21st National Conference on Artificial Intelligence, volume 21, 627\u2013634, 2006.","journal-title":"Proceedings of the 21st National Conference on Artificial Intelligence"},{"key":"2979_CR6","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-540-92185-1_71","volume-title":"Proceedings of the 4th International Workshop on Internet and Network Economics","author":"S. Dobzinski","year":"2008","unstructured":"S. Dobzinski and A. D. Procaccia: Frequent Manipulability of Elections: The Case of Two Voters, in: Proceedings of the 4th International Workshop on Internet and Network Economics, 653\u2013664. Springer, 2008."},{"key":"2979_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"P. Faliszewski","year":"2010","unstructured":"P. Faliszewski and A. D. Procaccia: AI\u2019sWar on Manipulation: AreWe Winning? AI Magazine 31 (2010), 53\u201364.","journal-title":"AI Magazine"},{"key":"2979_CR8","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1137\/090756740","volume":"40","author":"E. Friedgut","year":"2011","unstructured":"E. Friedgut, G. Kalai, N. Keller and N. Nisan: A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives, SIAM J. Comput. 40 (2011), 934\u2013952.","journal-title":"SIAM J. Comput."},{"key":"2979_CR9","first-page":"243","volume-title":"Proceedings of the 49th Annual Symposium on Foundations of Computer Science","author":"E. Friedgut","year":"2008","unstructured":"E. Friedgut, G. Kalai and N. Nisan: Elections can be manipulated often, in: Proceedings of the 49th Annual Symposium on Foundations of Computer Science, 243\u2013249. IEEE, 2008."},{"key":"2979_CR10","first-page":"587","volume-title":"Journal of the Econometric Society","author":"A. Gibbard","year":"1993","unstructured":"A. Gibbard: Manipulation of Voting Schemes: A General Result, Econometrica: Journal of the Econometric Society, 587\u2013601, 1993."},{"key":"2979_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"O. Goldreich, S. Goldwasser, E. Lehman, D. Ron and A. Samorodnitsky: Testing Monotonicity, Combinatorica 20 (2000), 301\u2013337.","journal-title":"Combinatorica"},{"key":"2979_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511616679","volume-title":"Global Methods for Combinatorial Isoperimetric Problems","author":"L. H. Harper","year":"2004","unstructured":"L. H. Harper: Global Methods for Combinatorial Isoperimetric Problems, Cambridge University Press, 2004."},{"key":"2979_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s00493-012-2704-1","volume":"32","author":"M. Isaksson","year":"2012","unstructured":"M. Isaksson, G. Kindler and E. Mossel: The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem, Combinatorica 32 (2012), 221\u2013250.","journal-title":"Combinatorica"},{"key":"2979_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00183344","volume":"10","author":"J. S. Kelly","year":"1993","unstructured":"J. S. Kelly: Almost all social choice rules are highly manipulable, but a few aren\u2019t, Social Choice and Welfare 10 (1993), 161\u2013175.","journal-title":"Social Choice and Welfare"},{"key":"2979_CR15","first-page":"508","volume-title":"American Mathematical Monthly","author":"J. H. Lindsey","year":"1994","unstructured":"J. H. Lindsey: Assignment of Numbers to Vertices, American Mathematical Monthly, 508\u2013516, 1994."},{"key":"2979_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00440-011-0362-7","volume":"154","author":"E. Mossel","year":"2012","unstructured":"E. Mossel: A quantitative Arrow theorem, Probability Theory and Related Fields 154 (2012), 49\u201388.","journal-title":"Probability Theory and Related Fields"},{"key":"2979_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02773611","volume":"154","author":"E. Mossel","year":"2006","unstructured":"E. Mossel, R. O\u2019Donnell, O. Regev, J. E. Steif and B. Sudakov: Noninteractive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality, Israel Journal of Mathematics 154 (2006), 299\u2013336.","journal-title":"Israel Journal of Mathematics"},{"key":"2979_CR18","first-page":"1041","volume-title":"Proceedings of the 44th ACM Symposium on Theory of Computing (STOC)","author":"E. Mossel","year":"2002","unstructured":"E. Mossel and M. Z. R\u00e1cz: A quantitative Gibbard-Satterthwaite theorem without neutrality, in: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), 1041\u20131060. ACM, 2002."},{"key":"2979_CR19","volume-title":"The Strategy of Social Choice","author":"H. Moulin","year":"1993","unstructured":"H. Moulin: The Strategy of Social Choice, North-Holland, 1993."},{"key":"2979_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1613\/jair.2148","volume":"28","author":"A. D. Procaccia","year":"2007","unstructured":"A. D. Procaccia and J. S. Rosenschein: Junta Distributions and the Average-case Complexity of Manipulating Elections, Journal of Artificial Intelligence Research, 28 (2007), 157\u2013181.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2979_CR21","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 SocialWelfare Functions, Journal of Economic Theory 10 (1975), 187\u2013217.","journal-title":"Journal of Economic Theory"},{"key":"2979_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/1386790.1386810","volume-title":"Proceedings of the 9th ACM Conference on Electronic Commerce","author":"L. Xia","year":"2008","unstructured":"L. Xia and V. Conitzer: A Sufficient Condition for Voting Rules to be Frequently Manipulable, in: Proceedings of the 9th ACM Conference on Electronic Commerce, 99\u2013108. ACM, 2008."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2979-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2979-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2979-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T11:17:24Z","timestamp":1565695044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2979-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,5]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["2979"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2979-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,5]]}}}