{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:08:03Z","timestamp":1785038883813,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642046445","type":"print"},{"value":"9783642046452","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_27","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"299-310","source":"Crossref","is-referenced-by-count":42,"title":["Swap Bribery"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arkadii","family":"Slinko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Social Choice and Welfare\u00a06(3), 227\u2013241 (1989)","journal-title":"Social Choice and Welfare"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-642-03816-7_12","volume-title":"MFCS 2009","author":"N. Betzler","year":"2009","unstructured":"Betzler, N., Dorn, B.: Towards a dichotomy of finding possible winners in elections based on scoring rules. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 124\u2013136. Springer, Heidelberg (2009)"},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.electstud.2005.05.007","volume":"25","author":"S. Brams","year":"2006","unstructured":"Brams, S., Sanver, R.: Critical strategies under approval voting: Who gets ruled in and ruled out. Electoral Studies\u00a025(2), 287\u2013305 (2006)","journal-title":"Electoral Studies"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Covey, J., Feldman, M., Homan, C., Kaklamanis, C., Karanikolas, N., Procaccia, A., Rosenschein, J.: On the approximability of Dodgson and Young elections. In: Proceedings of SODA-2009 (2009)","DOI":"10.1137\/1.9781611973068.115"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM\u00a054(3) (2007)","DOI":"10.1145\/1236457.1236461"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: On distance rationalizability of some voting rules. In: Proceedings of TARK-2009 (2009)","DOI":"10.1145\/1562814.1562831"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. Technical Report arXiv:0905.3885\u00a0[cs.GT], arXiv.org (May 2009)","DOI":"10.2139\/ssrn.1422183"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-85238-4_25","volume-title":"Mathematical Foundations of Computer Science 2008","author":"G. Erd\u00e9lyi","year":"2008","unstructured":"Erd\u00e9lyi, G., Nowak, M., Rothe, J.: Sincere-strategy preference-based approval voting broadly resists control. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 311\u2013322. Springer, Heidelberg (2008)"},{"key":"27_CR9","unstructured":"Faliszewski, P.: Nonuniform bribery (short paper). In: Proceedings of AAMAS-2008 (2008)"},{"key":"27_CR10","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: The complexity of bribery in elections. In: Proceedings of AAAI-2006 (2006)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. Journal of Artificial Intelligence Research (2009)","DOI":"10.1613\/jair.2697"},{"key":"27_CR12","unstructured":"Fellows, M., Rosamond, F., Slinko, A.: Sensing God\u2019s will is fixed parameter tractable. Technical Report N.561, Department of Mathematics. The University of Auckland (July 2008)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Friedgut, E., Kalai, G., Nisan, N.: Elections can be manipulated often. In: Proceedings of FOCS-2008 (2008)","DOI":"10.1109\/FOCS.2008.87"},{"key":"27_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":"27_CR15","unstructured":"Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proceedins of the Multidisciplinary IJCAI-2005 Worshop on Advances in Preference Handling, July\/August 2005, pp. 124\u2013129 (2005)"},{"key":"27_CR16","volume-title":"Power, Freedom, and Voting","author":"T. Meskanen","year":"2008","unstructured":"Meskanen, T., Nurmi, H.: Closeness counts in social choice. In: Braham, M., Steffen, F. (eds.) Power, Freedom, and Voting. Springer, Heidelberg (2008)"},{"key":"27_CR17","unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proceedings of AAAI-2007 (2007)"},{"key":"27_CR18","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of AAAI-2008 (2008)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V.: Generalized scoring rules and the frequency of coalitional manipulability. In: Proceedings of EC-2008 (2008)","DOI":"10.1145\/1386790.1386811"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V.: A sufficient condition for voting rules to be frequently manipulable. In: Proceedings of EC-2008 (2008)","DOI":"10.1145\/1386790.1386810"},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.artint.2008.11.005","volume":"173","author":"M. Zuckerman","year":"2008","unstructured":"Zuckerman, M., Procaccia, A., Rosenschein, J.: Algorithms for the coalitional manipulation problem. Artificial Intelligence\u00a0173(2), 392\u2013412 (2008)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:05Z","timestamp":1606185785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}