Abstract
In utilitarian social choice settings, agents have cardinal utilities over candidates, while for many reasons they only report their ordinal rankings for candidates. One possible way is to use voting systems that have access to the ordinal rankings, to maximize the sum of utility of all agents, i.e. social welfare. However, most work does not consider strategic play when using ordinal preferences as a proxy for cardinal utilities. In this paper, we present a new decision-making model of strategic voting to map cardinal utilities to votes under incomplete information. We consider an iterative setting, where agents will update their votes based on information observed from their neighbors in a social network. We compare our model with three existing models, one is a simple heuristic model and the other two are boundedly rational models. Results from extensive simulations on both random networks and a real social network show that although the strategic play is not frequent, sometimes rare, it does improve the social welfare of selected winners. We investigate the Duverger’s Law, showing that only the simple heuristic model that requires low cognitive efforts like human voters can replicate the law.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We obtained a smaller value of SF Ratio on m = 4 conditions than m = 5 conditions.
References
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Voudouris, A.A.: Peeking behind the ordinal curtain: improving distortion via cardinal queries. Artif. Intell. 296, 103488 (2021)
Anshelevich, E., Bhardwaj, O., Elkind, E., Postl, J., Skowron, P.: Approximating optimal social choice under metric preferences. Artif. Intell. 264, 27–51 (2018)
Baumeister, D., Selker, A.K., Wilczynski, A.: Manipulation of opinion polls to influence iterative elections. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 132–140 (2020)
Blais, A.: Why is there so little strategic voting in Canadian plurality rule elections? Polit. Stud. 50(3), 445–454 (2002)
Boutilier, C., Caragiannis, I., Haber, S., Lu, T., Procaccia, A.D., Sheffet, O.: Optimal social choice functions: a utilitarian view. Artif. Intell. 227, 190–213 (2015)
Bowman, C., Hodge, J.K., Yu, A.: The potential of iterative voting to solve the separability problem in referendum elections. Theory Decis. 77(1), 111–124 (2014)
Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)
Bredereck, R., Kaczmarczyk, A., Niedermeier, R.: Envy-free allocations respecting social networks. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. pp. 283–291 (2018)
Caragiannis, I., Procaccia, A.D.: Voting almost maximizes social welfare despite limited communication. Artif. Intell. 175(9–10), 1655–1671 (2011)
Cox, G.W.: Making Votes Count: Strategic Coordination in the World’s Electoral Systems. Cambridge University Press, Cambridge (1997)
Enelow, J.M., Hinich, M.J.: The Spatial Theory of Voting: An Introduction. Cambridge University Press, Cambridge (1984)
Fairstein, R., Lauz, A., Meir, R., Gal, K.: Modeling people’s voting behavior with poll information. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1422–1430 (2019)
Faliszewski, P., Gonen, R., Kouteckỳ, M., Talmon, N.: Opinion diffusion and campaigning on society graphs. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 219–225 (2018)
Grandi, U.: Social choice and social networks. In: Trends in Computational Social Choice, pp. 169–184 (2017)
Meir, R.: Iterative voting. In: Trends in Computational Social Choice, pp. 69–86 (2017)
Meir, R., Lev, O., Rosenschein, J.S.: A local-dominance theory of voting equilibria. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 313–330 (2014)
Meir, R., Polukarov, M., Rosenschein, J., Jennings, N.: Convergence to equilibria in plurality voting. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 24 (2010)
Paul, E., Alfréd, R.: On random graphs. I. Publicationes Mathematicae (Debrecen) 6, 290–297 (1959)
Procaccia, A.D., Rosenschein, J.S.: The distortion of cardinal preferences in voting. In: Klusch, M., Rovatsos, M., Payne, T.R. (eds.) CIA 2006. LNCS (LNAI), vol. 4149, pp. 317–331. Springer, Heidelberg (2006). https://doi.org/10.1007/11839354_23
Reijngoud, A.: Voter response to iterated poll information (2012)
Tsang, A., Larson, K.: The echo chamber: strategic voting and homophily in social networks. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 368–375 (2016)
Tsang, A., Salehi-Abari, A., Larson, K.: Boundedly rational voters in large (r) networks. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 301–308 (2018)
Viswanath, B., Mislove, A., Cha, M., Gummadi, K.P.: On the evolution of user interaction in Facebook. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 37–42 (2009)
Wilder, B., Vorobeychik, Y.: Controlling elections through social influence. In: International Conference on Autonomous Agents and Multiagent Systems (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, X., Ren, F., Su, G., Zhang, M. (2022). Strategies Improve Social Welfare: An Empirical Study of Strategic Voting in Social Networks. In: Long, G., Yu, X., Wang, S. (eds) AI 2021: Advances in Artificial Intelligence. AI 2022. Lecture Notes in Computer Science(), vol 13151. Springer, Cham. https://doi.org/10.1007/978-3-030-97546-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-97546-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97545-6
Online ISBN: 978-3-030-97546-3
eBook Packages: Computer ScienceComputer Science (R0)