{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T08:47:01Z","timestamp":1778748421325,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T00:00:00Z","timestamp":1360195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10472-013-9330-5","type":"journal-article","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T13:09:13Z","timestamp":1360156153000},"page":"135-160","source":"Crossref","is-referenced-by-count":11,"title":["Bribery in voting with CP-nets"],"prefix":"10.1007","volume":"68","author":[{"given":"Nicholas","family":"Mattei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Silvia","family":"Pini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Brent","family":"Venable","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"key":"9330_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)"},{"key":"9330_CR2","unstructured":"Arrow, K.J.: Social Choice and Individual Values. Wiley (1963)"},{"key":"9330_CR3","volume-title":"Handbook of Social Choice and Welfare","author":"KJ Arrow","year":"2002","unstructured":"Arrow, K.J., Sen, A.K., Suzumura, K.: Handbook of Social Choice and Welfare. Elsevier, North-Holland (2002)"},{"issue":"3","key":"9330_CR4","doi-asserted-by":"crossref","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 Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"key":"9330_CR5","doi-asserted-by":"crossref","unstructured":"Birrell, E., Pass, R.: Approximately strategy-proof voting. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 67\u201372 (2011)","DOI":"10.21236\/ADA582553"},{"key":"9330_CR6","unstructured":"Boutilier, C., Bacchus, F., Brafman, R.: UCP-networks: a directed graphical representation of conditional utilities. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI 2001), pp. 56\u201364 (2001)"},{"issue":"1","key":"9330_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21(1), 135\u2013191 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"9330_CR8","unstructured":"Brafman, R.I., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Finding the next solution in constraint- and preference-based knowledge representation formalisms. In: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2010) (2010)"},{"issue":"2","key":"9330_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s003550050101","volume":"15","author":"S Brams","year":"1998","unstructured":"Brams, S., Kilgour, D., Zwicker, W.: The paradox of multiple elections. Soc. Choice Welf. 15(2), 211\u2013236 (1998)","journal-title":"Soc. Choice Welf."},{"key":"9330_CR10","unstructured":"Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Weiss, G. (ed.) Multiagent Systems. MIT Press (2012)"},{"issue":"3","key":"9330_CR11","first-page":"217","volume":"11","author":"R Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., Slinko, A.: On complexity of lobbying in multiple referenda. Rev. Econ. Des. 11(3), 217\u2013224 (2007)","journal-title":"Rev. Econ. Des."},{"key":"9330_CR12","unstructured":"Conitzer, V., Lang, J., Xia, L.: How hard is it to control sequential elections via the agenda? In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 103\u2013108 (2009)"},{"issue":"3","key":"9330_CR13","doi-asserted-by":"crossref","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? JACM 54(3), 1\u201333 (2007)","journal-title":"JACM"},{"key":"9330_CR14","unstructured":"Conitzer, V., Xia, L.: Approximating common voting rules by sequential voting in multi-issue domains. In: Proc. International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012)\u2014Special Session on Computational Social Choice (2012)"},{"key":"9330_CR15","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64, 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"9330_CR16","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"9330_CR17","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Proceedings of the 6th International Workshop on Internet and Network Economics (WINE 2010), pp. 473\u2013482 (2010)","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"9330_CR18","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. Algorithmic Game Theory, pp. 299\u2013310 (2009)","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"9330_CR19","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., Raible, D., Rothe, J.: The complexity of probabilistic lobbying. In: Proc. 1st International Conference on Algorithmic Decision Theory (ADT 2009), pp. 86\u201397 (2009)","DOI":"10.1007\/978-3-642-04428-1_8"},{"key":"9330_CR20","unstructured":"Faliszewski, P.: Nonuniform bribery. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1569\u20131572 (2008)"},{"key":"9330_CR21","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"Artif. Intell. Res."},{"key":"9330_CR22","unstructured":"Faliszewski, P., Hemaspaandra, E., Schnoor, H.: Copeland voting: ties matter. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008) (2008)"},{"issue":"4","key":"9330_CR23","doi-asserted-by":"crossref","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":"9330_CR24","unstructured":"Lang, J.: Vote and aggregation in combinatorial domains with structured preferences. In: Proceedings of the 20nd International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1366\u20131371 (2007)"},{"issue":"1","key":"9330_CR25","first-page":"130","volume":"25","author":"J Lang","year":"2012","unstructured":"Lang, J., Pini, M.S., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Winner determination in voting trees with incomplete preferences and weighted votes. JAAMAS 25(1), 130\u2013157 (2012)","journal-title":"JAAMAS"},{"key":"9330_CR26","unstructured":"Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: Proceedings of the 20nd International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1372\u20131377 (2007)"},{"issue":"3","key":"9330_CR27","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.mathsocsci.2008.12.010","volume":"57","author":"J Lang","year":"2009","unstructured":"Lang, J., Xia, L.: Sequential composition of voting rules in multi-issue domains. Math. Soc. Sci. 57(3), 304\u2013324 (2009)","journal-title":"Math. Soc. Sci."},{"key":"9330_CR28","unstructured":"Magrino, T., Rivest, R., Shen, E., Wagner, D.: Computing the margin of victory in IRV elections. In: Proc. Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections (2011)"},{"key":"9330_CR29","unstructured":"Mattei, N., Pini, M.S., Rossi, F., Venable, K.B.: Bribery in voting over combinatorial domains is easy. In: Proceedings of the 11th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), pp. 1407\u20131408 (2012) (Extended Abstract)"},{"issue":"4","key":"9330_CR30","doi-asserted-by":"crossref","first-page":"680","DOI":"10.2307\/1907651","volume":"20","author":"K May","year":"1952","unstructured":"May, K.: A set of independent necessary and sufficient conditions for simple majority decisions. Econometrica 20(4), 680\u2013684 (1952)","journal-title":"Econometrica"},{"key":"9330_CR31","unstructured":"Obraztsova, S., Elkind, E.: On the complexity of voting manipulation under randomized tie-breaking. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 319\u2013324 (2011)"},{"key":"9330_CR32","unstructured":"Obraztsova, S., Elkind, E., Hazon, N.: Ties matter: complexity of voting manipulation revisited. In: Proceedings of the 10th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 71\u201378 (2011)"},{"key":"9330_CR33","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Incompleteness and incomparability in preference aggregation. In: Proceedings of the 20nd International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1464\u20131469 (2007)"},{"issue":"7\u20138","key":"9330_CR34","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1016\/j.artint.2010.11.009","volume":"175","author":"MS Pini","year":"2011","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Incompleteness and incomparability in preference aggregation: complexity results. Artif. Intell. 175(7\u20138), 1272\u20131289 (2011)","journal-title":"Artif. Intell."},{"key":"9330_CR35","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Possible and necessary winners in voting trees: majority graphs vs. profiles. In: Proceedings of the 10th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 311\u2013318 (2011)"},{"issue":"2","key":"9330_CR36","doi-asserted-by":"crossref","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. Theory 10(2), 187\u2013216 (1975)","journal-title":"J. Econ. Theory"},{"key":"9330_CR37","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC 2012), pp. 982\u2013999 (2012)","DOI":"10.1145\/2229012.2229086"},{"key":"9330_CR38","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V.: Strategy-proof voting rules over multi-issue domains with restricted preferences. In: Proceedings of the 6th International Workshop on Internet and Network Economics (WINE 2010), pp. 402\u2013414 (2010)","DOI":"10.1007\/978-3-642-17572-5_33"},{"key":"9330_CR39","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.3186","volume":"41","author":"L Xia","year":"2011","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners given partial orders. J. Artif. Intell. Res. 41, 25\u201367 (2011)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9330-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9330-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9330-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T09:56:06Z","timestamp":1562666166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9330-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,7]]},"references-count":39,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9330"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9330-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,7]]}}}