{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:57Z","timestamp":1759638417774},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"AGH University","award":["11.11.230.124"],"award-info":[{"award-number":["11.11.230.124"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10472-015-9478-2","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T17:59:27Z","timestamp":1441216767000},"page":"225-250","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The complexity of priced control in elections"],"prefix":"10.1007","volume":"77","author":[{"given":"Tomasz","family":"Miasko","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"issue":"2","key":"9478_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welf. 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"8\/9","key":"9478_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: How hard is it to control an election Math. Comput. Model. 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"9478_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.mathsocsci.2015.03.006","volume":"76","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O., Rothe, J.: Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. 76, 19\u201330 (2015)","journal-title":"Math. Soc. Sci."},{"key":"9478_CR4","unstructured":"Baumeister, D., Faliszewski, P., Lang, J., Rothe, J.: Campaigns for lazy voters: Truncated ballots. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 577\u2013584. International Foundation for Autonomous Agents and Multiagent Systems (2012)"},{"key":"9478_CR5","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Roos, M., Rothe, J., Schend, L., Xia, L.: The possible winner problem with uncertain weights. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 133\u2013138. IOS Press (2012)","DOI":"10.1016\/j.jcss.2023.103464"},{"issue":"52","key":"9478_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 43\u201353 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9478_CR7","doi-asserted-by":"publisher","unstructured":"Brams, S., Fishburn, P.: Voting procedures. In: Arrow, K., Sen, A., Suzumura, K. (eds.) Handbook of Social Choice and Welfare, vol. 1, pp. 173\u2013236. Elsevier (2002)","DOI":"10.1016\/S1574-0110(02)80008-X"},{"key":"9478_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.: Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 715\u2013722. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7637"},{"key":"9478_CR9","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., Niedermeier, R.: Prices matter for the parameterized complexity of shift bribery. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 1398\u20131404. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8881"},{"key":"9478_CR10","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., Talmon, N.: Large-scale election campaigns: Combinatorial shift bribery. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 67\u201375 (2015)"},{"key":"9478_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2015.04.023","volume":"589","author":"L Bulteau","year":"2015","unstructured":"Bulteau, L., Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Combinatorial voter control in elections. Theor. Comput. Sci. 589, 99\u2013120 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9478_CR12","doi-asserted-by":"crossref","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Elections with few voters: Candidate control can be easy. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 2045\u20132051 (2015)","DOI":"10.1609\/aaai.v29i1.9429"},{"issue":"1","key":"9478_CR13","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.mathsocsci.2011.12.003","volume":"64","author":"Y Chevaleyre","year":"2012","unstructured":"Chevaleyre, Y., Lang, J., Maudet, N., Monnot, J., Xia, L.: New candidates welcome! possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64(1), 74\u201388 (2012)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"9478_CR14","doi-asserted-by":"publisher","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(1), 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"9478_CR15","doi-asserted-by":"publisher","unstructured":"Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Proceedings of the 6th International Workshop On Internet And Network Economics, pp. 473\u2013482. Springer-Verlag Lecture Notes in Computer Science #6484 (2010)","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"9478_CR16","doi-asserted-by":"publisher","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Proceedings of the 2nd International Symposium on Algorithmic Game Theory, pp. 299\u2013310. Springer-Verlag Lecture Notes in Computer Science #5814 (2009)","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"9478_CR17","first-page":"529","volume":"42","author":"E Elkind","year":"2011","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Cloning in elections: finding the possible winners. J. Artif. Intell. Res. 42, 529\u2013573 (2011)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"9478_CR18","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.jcss.2014.11.002","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4), 632\u2013660 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"9478_CR19","unstructured":"Faliszewski, P.: Nonuniform bribery (short paper). In: Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems, pp. 1569\u20131572. International Foundation for Autonomous Agents and Multiagent Systems (2008)"},{"key":"9478_CR20","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":"J. Artif. Intell. Res."},{"issue":"11","key":"9478_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Using complexity to protect elections. Commun. ACM 53(11), 74\u201382 (2010)","journal-title":"Commun. ACM"},{"key":"9478_CR22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.3136","volume":"40","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Multimode control attacks on elections. J. Artif. Intell. Res. 40, 305\u2013351 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"9478_CR23","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1613\/jair.4621","volume":"52","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Weighted electoral control. J. Artif. Intell. Res. 52, 507\u2013542 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"9478_CR24","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. 35, 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9478_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2010.09.001","volume":"209","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2), 89\u2013107 (2011)","journal-title":"Inf. Comput."},{"issue":"4","key":"9478_CR26","first-page":"52","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Procaccia, A.: AI\u2019s war on manipulation: Are we winning AI Mag. 31(4), 52\u201364 (2010)","journal-title":"AI Mag."},{"issue":"1","key":"9478_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TC.1982.1675885","volume":"C-31","author":"H Garcia-Molina","year":"1982","unstructured":"Garcia-Molina, H.: Elections in a distributed computing system. IEEE Trans. Comput. C-31(1), 48\u201359 (1982)","journal-title":"IEEE Trans. Comput."},{"key":"9478_CR28","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"issue":"4","key":"9478_CR29","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"9478_CR30","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Menton, C.: Search versus decision for election manipulation problems. In: Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science, pp. 377\u2013388. Leibniz-Zentrum f\u00fcr Informatik (2013)"},{"issue":"6","key":"9478_CR31","doi-asserted-by":"publisher","first-page":"806?","DOI":"10.1145\/268999.269002","volume":"44","author":"E Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. J. ACM 44(6), 806\u2013825 (1997)","journal-title":"J. ACM"},{"issue":"5?6","key":"9478_CR32","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., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"3","key":"9478_CR33","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9478_CR34","first-page":"19","volume":"12","author":"M Kuta","year":"2011","unstructured":"Kuta, M., Kitowski, J.: Benchmarking high performance architectures with natural language processing algorithms. Comput. Sci. 12, 19\u201331 (2011)","journal-title":"Comput. Sci."},{"issue":"4","key":"9478_CR35","first-page":"51","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport, L.: Paxos made simple. SIGACT News 32(4), 51\u201358 (2001)","journal-title":"SIGACT News"},{"issue":"27\u201329","key":"9478_CR36","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1016\/j.tcs.2009.04.004","volume":"410","author":"H Liu","year":"2009","unstructured":"Liu, H., Feng, H., Zhu, D., Luan, J.: Parameterized computational complexity of control problems in voting systems. Theor. Comput. Sci. 410(27\u201329), 2746\u20132753 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"9478_CR37","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ipl.2010.03.006","volume":"110","author":"H Liu","year":"2010","unstructured":"Liu, H., Zhu, D.: Parameterized complexity of control problems in maximin election. Inf. Process. Lett. 110(10), 383\u2013388 (2010)","journal-title":"Inf. Process. Lett."},{"key":"9478_CR38","unstructured":"Magiera, K., Faliszewski, P.: How hard is control in single-crossing elections?. In: Proceedings of the 21st European Conference on Artificial Intelligence, pp. 579\u2013584. IOS Press (2014)"},{"key":"9478_CR39","unstructured":"Magrino, T., Rivest, R., Shen, E., Wagner, D.: Computing the margin of victory in IRV elections. Presented at 2011 Electronic Voting Technology Workshop\/Workshop on Trushworthy Elections (2011)"},{"key":"9478_CR40","unstructured":"Mattei, N., Goldsmith, J., Klapper, A.: On the complexity of bribery and manipulation in tournaments with uncertain information. In: Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference, pp. 549\u2013554 (2012)"},{"key":"9478_CR41","unstructured":"Mattei, N., Pini, M., Rossi, F., Venable, K.: Bribery in voting over combinatorial domains is easy. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 1407\u20131408. International Foundation for Autonomous Agents and Multiagent Systems (2012)"},{"key":"9478_CR42","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A., Rosenschein, J., Zohar, A.: The complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149\u2013178 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"9478_CR43","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley (1994)"},{"key":"9478_CR44","doi-asserted-by":"crossref","unstructured":"Parkes, D., Xia, L.: A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1429\u20131435. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8258"},{"key":"9478_CR45","doi-asserted-by":"publisher","unstructured":"Rey, A., Rothe, J.: Bribery in path-disruption games. In: Proceedings of the 2nd International Conference on Algorithmic Decision Theory, pp. 247\u2013261. Springer-Verlag Lecture Notes in Computer Science #6992 (2011)","DOI":"10.1007\/978-3-642-24873-3_19"},{"issue":"4","key":"9478_CR46","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00224-002-1093-z","volume":"36","author":"J Rothe","year":"2003","unstructured":"Rothe, J., Spakowski, H., Vogel, J.: Exact complexity of the winner problem for Young elections. Theory Comput. Syst. 36(4), 375\u2013386 (2003)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"9478_CR47","doi-asserted-by":"publisher","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\u2013217 (1975)","journal-title":"J. Econ. Theory"},{"key":"9478_CR48","doi-asserted-by":"crossref","unstructured":"Wojtas, K., Faliszewski, P.: Possible winners in noisy elections. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1499\u20131505 (2012)","DOI":"10.1609\/aaai.v26i1.8255"},{"key":"9478_CR49","doi-asserted-by":"publisher","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 982\u2013999. ACM Press (2012)","DOI":"10.1145\/2229012.2229086"},{"key":"9478_CR50","unstructured":"Xia, L.: Fixed-parameter tractability of integer generalized scoring rules. In: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, pp. 1599\u20131600 (2014)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9478-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-015-9478-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-015-9478-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T17:27:33Z","timestamp":1691947653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-015-9478-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,3]]},"references-count":50,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9478"],"URL":"https:\/\/doi.org\/10.1007\/s10472-015-9478-2","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,3]]}}}