{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:10:04Z","timestamp":1748715004293,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"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:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_23","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"314-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Often Harder than in the Constructive Case: Destructive Bribery in CP-nets"],"prefix":"10.1007","author":[{"given":"Britta","family":"Dorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominikus","family":"Kr\u00fcger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Scharpfenecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","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, 135\u2013191 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR2","unstructured":"Brafman, R., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Finding the next solution in constraint- and preference-based knowledge representation formalisms. In: 12th International Conference: Principles of Knowledge Representation and Reasoning, pp. 425\u2013433. AAAI Press (2010)"},{"key":"23_CR3","unstructured":"Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Multiagent Systems, pp. 213\u2013283. MIT Press (2013)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Lang, J., Sandholm, T.: How many candidates are needed to make elections hard to manipulate? In: 9th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 201\u2013214. ACM (2003)","DOI":"10.1145\/846241.846268"},{"key":"23_CR5","unstructured":"Conitzer, V., Lang, J., Xia, L.: Hypercubewise preference aggregation in multi-issue domains. In: 22nd International Joint Conference on Artificial Intelligence, pp. 158\u2013163. AAAI Press (2011)"},{"key":"23_CR6","unstructured":"Conitzer, V., Sandholm, T.: Complexity of manipulating elections with few candidates. In: 18th National Conference on Artificial Intelligence, pp. 314\u2013319. AAAI Press (2002)"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Dorn, B., Kr\u00fcger, D.: On the hardness of bribery variants in voting with CP-nets. Ann. Math. Artif. Intell., 1\u201329 (2015). doi:10.1007\/s10472-015-9469-3","DOI":"10.1007\/s10472-015-9469-3"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Dorn, B., Kr\u00fcger, D., Scharpfenecker, P.: Often harder than in the constructive case: destructive bribery in CP-nets, pp. 1\u201322 (2015). CoRR abs\/1509.08628","DOI":"10.1007\/978-3-662-48995-6_23"},{"key":"23_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) Algorithmic Game Theory. LNCS, vol. 5814, pp. 299\u2013310. Springer, Heidelberg (2009)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, L., Hemaspaandra, E., Rothe, J.: A richer understanding of the complexity of election systems. In: Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz, 1st edn., chap. 14, pp. 375\u2013406. Springer (2009)","DOI":"10.1007\/978-1-4020-9688-4_14"},{"key":"23_CR11","unstructured":"Faliszewski, P.: Nonuniform bribery. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3, pp. 1569\u20131572. IFAAMAS (2008)"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How hard is bribery in elections? J. Artif. Intell. Res. 35(2), 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. (JAIR) 35, 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"23_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"5\u20136","key":"23_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"key":"23_CR16","unstructured":"Lang, J.: Vote and aggregation in combinatorial domains with structured preferences. In: 20th International Joint Conference on Artificial Intelligence, pp. 1366\u20131371 (2007)"},{"key":"23_CR17","unstructured":"Magrino, T.R., Rivest, R.L., Shen, E.: Computing the margin of victory in IRV elections. In: Electronic Voting Technology Workshop \/ Workshop on Trustworthy Elections. USENIX Association (2011)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Maran, A., Maudet, N., Pini, M.S., Rossi, F., Venable, K.B.: A framework for aggregating influenced CP-nets and its resistance to bribery. In: 27th AAAI Conference on Artificial Intelligence, pp. 668\u2013674. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8639"},{"issue":"1\u20133","key":"23_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10472-013-9330-5","volume":"68","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Pini, M.S., Rossi, F., Venable, K.B.: Bribery in voting with CP-nets. Ann. Math. Artif. Intell. 68(1\u20133), 135\u2013160 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"23_CR20","unstructured":"Norden, L., Burstein, A., Hall, J.L., Chen, M.: Post-election audits: restoring trust in elections. Brennan Center for Justice at New York University, Tech. report (2007)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Pini, M., Rossi, F., Venable, K.: Bribery in voting with soft constraints. In: 27th AAAI Conference on Artificial Intelligence, pp. 803\u2013809. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8586"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Purrington, K., Durfee, E.H.: Making social choices from individuals\u2019 CP-nets. In: 6th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1122\u20131124. IFAAMAS (2007)","DOI":"10.1145\/1329125.1329341"},{"key":"23_CR23","unstructured":"Reisch, Y., Rothe, J., Schend, L.: The margin of victory in schulze, cup, and copeland elections: complexity of the regular and exact variants. In: 7th European Starting AI Researcher Symposium, pp. 250\u2013259. IOS Press (2014)"},{"key":"23_CR24","unstructured":"Rossi, F., Venable, K.B., Walsh, T.: mCP Nets: representing and reasoning with preferences of multiple agents. In: 19th National Conference on Artificial Intelligence, pp. 729\u2013734. AAAI Press (2004)"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1109\/TIFS.2009.2034190","volume":"4","author":"PB Stark","year":"2009","unstructured":"Stark, P.B.: Risk-limiting post-election audits: P-values from common probability inequalities. IEEE Trans. Inf. Forensics Secur. 4, 1005\u20131014 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, 4\u20138 June 2012, pp. 982\u2013999. ACM (2012)","DOI":"10.1145\/2229012.2229086"},{"key":"23_CR27","unstructured":"Xia, L., Conitzer, V., Lang, J.: Voting on multiattribute domains with cyclic preferential dependencies. In: 23rd AAAI Conference on Artificial Intelligence, pp. 202\u2013207. AAAI Press (2008)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T17:54:09Z","timestamp":1748714049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_23","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":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}