{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:36Z","timestamp":1740122196921,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10458-023-09602-z","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T20:34:51Z","timestamp":1679862891000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Electoral manipulation via influence: probabilistic model"],"prefix":"10.1007","volume":"37","author":[{"given":"Liangde","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3909-4916","authenticated-orcid":false,"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouhuai","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhimin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"key":"9602_CR1","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1613\/jair.4927","volume":"55","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., & Talmon, N. (2016). Large-scale election campaigns: Combinatorial shift bribery. Journal of Artificial Intelligence Research, 55, 603\u2013652.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9602_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103520","volume":"298","author":"P Faliszewski","year":"2021","unstructured":"Faliszewski, P., Manurangsi, P., & Sornat, K. (2021). Approximation and hardness of shift-bribery. Artificial Intelligence, 298, 103520.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9602_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10458-019-09403-3","volume":"33","author":"A Kaczmarczyk","year":"2019","unstructured":"Kaczmarczyk, A., & Faliszewski, P. (2019). Algorithms for destructive shift bribery. Autonomous Agents and Multi-Agent Systems, 33(3), 275\u2013297.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"3","key":"9602_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3396855","volume":"8","author":"D Knop","year":"2020","unstructured":"Knop, D., Kouteck\u1ef3, M., & Mnich, M. (2020). Voting and bribing in single-exponential time. ACM Transactions on Economics and Computation, 8(3), 1\u201328.","journal-title":"ACM Transactions on Economics and Computation"},{"issue":"1.1","key":"9602_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1201\/b17231-3","volume":"37","author":"H Zhang","year":"2014","unstructured":"Zhang, H., Mishra, S., Thai, M. T., Wu, J., & Wang, Y. (2014). Recent advances in information diffusion and influence maximization in complex social networks. Opportunistic Mobile Social Networks, 37(1.1), 37.","journal-title":"Opportunistic Mobile Social Networks"},{"key":"9602_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-2879-0","volume-title":"Probability and social science: Methodological relationships between the two approaches","author":"D Courgeau","year":"2012","unstructured":"Courgeau, D. (2012). Probability and social science: Methodological relationships between the two approaches. Berlin: Springer."},{"issue":"4","key":"9602_CR7","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1037\/h0030064","volume":"16","author":"RS Wyer","year":"1970","unstructured":"Wyer, R. S. (1970). Quantitative prediction of belief and opinion change: A further test of a subjective probability model. Journal of Personality and Social Psychology, 16(4), 559.","journal-title":"Journal of Personality and Social Psychology"},{"key":"9602_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.jet.2019.04.008","volume":"182","author":"I Arieli","year":"2019","unstructured":"Arieli, I., & Babichenko, Y. (2019). Private Bayesian persuasion. Journal of Economic Theory, 182, 185\u2013217.","journal-title":"Journal of Economic Theory"},{"issue":"8","key":"9602_CR9","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1287\/mnsc.22.8.829","volume":"22","author":"V Balachandran","year":"1976","unstructured":"Balachandran, V., & Deshmukh, S. (1976). A stochastic model of persuasive communication. Management Science, 22(8), 829\u2013840.","journal-title":"Management Science"},{"key":"9602_CR10","doi-asserted-by":"crossref","unstructured":"Tsakas, E., Tsakas, N., Xefteris, D. (2021). Resisting persuasion. Economic Theory, 1\u201320","DOI":"10.1007\/s00199-020-01339-0"},{"key":"9602_CR11","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A. (2009). Swap bribery. In Proceedings of the 2nd international symposium on algorithmic game theory, pp. 299\u2013310. Springer","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"9602_CR12","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P. (2010). Approximation algorithms for campaign management. In Internet and network economics, pp. 473\u2013482","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"9602_CR13","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. (2009). How hard is bribery in elections? Journal of Artificial Intelligence Research, 35, 485\u2013532.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9602_CR14","doi-asserted-by":"crossref","unstructured":"Chen, L., Xu, L., Xu, S., Gao, Z., Shi, W. (2019). Election with bribed voter uncertainty: Hardness and approximation algorithm. In Proceedings of 33rd the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v33i01.33012572"},{"key":"9602_CR15","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ic.2016.08.003","volume":"251","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., & Niedermeier, R. (2016). Prices matter for the parameterized complexity of shift bribery. Information and Computation, 251, 140\u2013164.","journal-title":"Information and Computation"},{"key":"9602_CR16","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., Talmon, N. (2016). Complexity of shift bribery in committee elections. In Proceedings of the 30th AAAI conference on artificial intelligence, pp. 2452\u20132458","DOI":"10.1609\/aaai.v30i1.10132"},{"key":"9602_CR17","unstructured":"Brelsford, E., Faliszewski, P., Hemaspaandra, E., Schnoor, H., Schnoor, I. (2008). Approximability of manipulating elections. In Proceedings of the 23rd AAAI conference on artificial intelligence, vol. 1, pp. 44\u201349"},{"key":"9602_CR18","doi-asserted-by":"crossref","unstructured":"Xia, L. (2012). Computing the margin of victory for various voting rules. In Proceedings of the 13th ACM conference on electronic commerce, pp. 982\u2013999","DOI":"10.1145\/2229012.2229086"},{"issue":"6","key":"9602_CR19","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s10458-014-9277-x","volume":"29","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Reisch, Y., Rothe, J., & Schend, L. (2015). Complexity of manipulation, bribery, and campaign management in Bucklin and Fallback voting. Autonomous Agents and Multi-Agent Systems, 29(6), 1091\u20131124.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9602_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1613\/jair.3136","volume":"40","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2011). Multimode control attacks on elections. Journal of Artificial Intelligence Research, 40, 305\u2013351.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9602_CR21","doi-asserted-by":"crossref","unstructured":"Parkes, D.C., Xia, L. (2012). 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","DOI":"10.1609\/aaai.v26i1.8258"},{"key":"9602_CR22","unstructured":"Magrino, T.R., Rivest, R.L., Shen, E., Wagner, D. (2011). Computing the margin of victory in IRV elections. In Proceedings of the 2011 conference on electronic voting technology\/workshop on trustworthy elections, p. 4"},{"key":"9602_CR23","unstructured":"Dey, P., Narahari, Y. (2015). Estimating the margin of victory of an election using sampling. In Proceedings of the 24th international joint conference on artificial intelligence"},{"key":"9602_CR24","unstructured":"Reisch, Y., Rothe, J., Schend, L. (2014). The margin of victory in Schulze, cup, and Copeland elections: Complexity of the regular and exact variants. In Proceedings of the 7th European starting AI researcher symposium, pp. 250\u2013259"},{"issue":"1","key":"9602_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/S0007123408000422","volume":"39","author":"SB Hobolt","year":"2009","unstructured":"Hobolt, S. B., Spoon, J.-J., & Tilley, J. (2009). A vote against Europe? Explaining defection at the 1999 and 2004 European parliament elections. British Journal of Political Science, 39(1), 93\u2013115.","journal-title":"British Journal of Political Science"},{"key":"9602_CR26","doi-asserted-by":"crossref","unstructured":"Wojtas, K., Faliszewski, P. (2012). Possible winners in noisy elections. In Proceedings of the 26th AAAI conference on artificial intelligence, pp. 1499\u20131505","DOI":"10.1609\/aaai.v26i1.8255"},{"key":"9602_CR27","unstructured":"Erdelyi, G., Hemaspaandra, E., Hemaspaandra, L. A. (2014). Bribery and voter control under voting-rule uncertainty. In Proceedings of the 13th international conference on autonomous agents and multiagent systems, pp. 61\u201368"},{"issue":"4","key":"9602_CR28","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.jal.2015.03.004","volume":"13","author":"N Mattei","year":"2015","unstructured":"Mattei, N., Goldsmith, J., Klapper, A., & Mundhenk, M. (2015). On the complexity of bribery and manipulation in tournaments with uncertain information. Journal of Applied Logic, 13(4), 557\u2013581.","journal-title":"Journal of Applied Logic"},{"key":"9602_CR29","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., Raible, D., Rothe, J. (2009). The complexity of probabilistic lobbying. In Proceedings of the 1st international conference on algorithmic decision theory, pp. 86\u201397","DOI":"10.1007\/978-3-642-04428-1_8"},{"key":"9602_CR30","doi-asserted-by":"crossref","unstructured":"Chen, L., Xu, L., Xu, S., Gao, Z., Shi, W. (2019). Election with bribe-effect uncertainty: A dichotomy result. In Proceedings of the 28th international joint conference on artificial intelligence","DOI":"10.24963\/ijcai.2019\/23"},{"key":"9602_CR31","unstructured":"Endriss, U. (2017). Trends in computational social choice."},{"key":"9602_CR32","unstructured":"Wilder, B., Vorobeychik, Y. (2018). Controlling elections through social influence. In Proceedings of the 17th international conference on autonomous agents and multiagent systems, pp. 265\u2013273"},{"key":"9602_CR33","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Gonen, R., Kouteck\u1ef3, M., Talmon, N. (2018). Pinion diffusion and campaigning on society graphs. In Proceedings of the 27th international joint conference on artificial intelligence, pp. 219\u2013225","DOI":"10.24963\/ijcai.2018\/30"},{"key":"9602_CR34","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Elkind, E. (2017). Manipulating opinion diffusion in social networks. In Proceedings of the 26th international joint conference on artificial intelligence, pp. 894\u2013900","DOI":"10.24963\/ijcai.2017\/124"},{"key":"9602_CR35","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2017.10.028","volume":"708","author":"N Talmon","year":"2018","unstructured":"Talmon, N. (2018). Structured proportional representation. Theoretical Computer Science, 708, 58\u201374.","journal-title":"Theoretical Computer Science"},{"key":"9602_CR36","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis.","DOI":"10.1017\/CBO9780511813603"},{"key":"9602_CR37","unstructured":"Lin, A. (2011). The complexity of manipulating $$\\kappa $$-approval elections. In Proceedings of the 3rd international conference on agents and artificial intelligence, vol. 2, pp. 212\u2013218"},{"issue":"2","key":"9602_CR38","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"AC Yao","year":"1980","unstructured":"Yao, A. C. (1980). New algorithms for bin packing. Journal of the ACM, 27(2), 207\u2013227.","journal-title":"Journal of the ACM"},{"key":"9602_CR39","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2020.01.017","volume":"814","author":"R Bredereck","year":"2020","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., Skowron, P., & Talmon, N. (2020). Mixed integer programming with convex\/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theoretical Computer Science, 814, 86\u2013105.","journal-title":"Theoretical Computer Science"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09602-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-023-09602-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09602-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:44:42Z","timestamp":1683791082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-023-09602-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9602"],"URL":"https:\/\/doi.org\/10.1007\/s10458-023-09602-z","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2023,3,8]]},"assertion":[{"value":"4 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"18"}}