Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Private Blotto: Viewpoint Competition with Polarized Agents (2302.14123v3)

Published 27 Feb 2023 in cs.GT, cs.CY, and cs.SI

Abstract: Social media platforms are responsible for collecting and disseminating vast quantities of content. Recently, however, they have also begun enlisting users in helping annotate this content - for example, to provide context or label disinformation. However, users may act strategically, sometimes reflecting biases (e.g. political) about the "right" label. How can social media platforms design their systems to use human time most efficiently? Historically, competition over multiple items has been explored in the Colonel Blotto game setting (Borel, 1921). However, they were originally designed to model two centrally-controlled armies competing over zero-sum "items", a specific scenario with limited modern-day application. In this work, we propose and study the Private Blotto game, a variant with the key difference that individual agents act independently, without being coordinated by a central "Colonel". We completely characterize the Nash stability of this game and how this impacts the amount of "misallocated effort" of users on unimportant items. We show that the outcome function (aggregating multiple labels on a single item) has a critical impact, and specifically contrast a majority rule outcome (the median) as compared to a smoother outcome function (mean). In general, for median outcomes we show that instances without stable arrangements only occur for relatively few numbers of agents, but stable arrangements may have very high levels of misallocated effort. For mean outcome functions, we show that unstable arrangements can occur even for arbitrarily large numbers of agents, but when stable arrangements exist, they always have low misallocated effort. We conclude by discussing implications our results have for motivating examples in social media platforms and political competition.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. From duels to battlefields: Computing equilibria of Blotto and other games. Proceedings of the AAAI Conference on Artificial Intelligence (2016).
  2. Birds of a Feather Don’t Fact-Check Each Other: Partisanship and the Evaluation of News in Twitter’s Birdwatch Crowdsourced Fact-Checking Program. Association for Computing Machinery, New York, NY, USA. https://doi.org/10.1145/3491102.3502040
  3. Proportional resource allocation in dynamic n-player Blotto games. arXiv preprint arXiv:2010.05087 (2020).
  4. The price of stability for network design with fair cost allocation. SIAM J. Comput. 38, 4 (2008), 1602–1623.
  5. Predictive models for human–AI nexus in group decision making. Annals of the New York Academy of Sciences 1514, 1 (2022), 70–81.
  6. Achieving consensus in multilateral international negotiations: The case study of the 2015 Paris Agreement on climate change. Science Advances 7, 51 (2021), eabg8068. https://doi.org/10.1126/sciadv.abg8068 arXiv:https://www.science.org/doi/pdf/10.1126/sciadv.abg8068
  7. The multiplayer colonel blotto game. In Proceedings of the 21st ACM Conference on Economics and Computation. 47–48.
  8. Emile Borel. 1921. La théorie du jeu et les équations intégralesa noyau symétrique. Comptes rendus de l’Académie des Sciences 173, 1304-1308 (1921), 58.
  9. Democracy for Polarized Committees: The Tale of Blotto’s Lieutenants. Games and Economic Behavior 106 (2017), 239–259. https://doi.org/10.1016/j.geb.2017.10.009
  10. Noah E. Friedkin and Eugene C. Johnsen. 1990. Social influence and opinions. The Journal of Mathematical Sociology 15, 3-4 (1990), 193–206. https://doi.org/10.1080/0022250X.1990.9990069 arXiv:https://doi.org/10.1080/0022250X.1990.9990069
  11. Russell Golman and Scott E Page. 2009. General Blotto: games of allocative strategic mismatch. Public Choice 138, 3 (2009), 279–299.
  12. Sanjeev Goyal and Adrien Vigier. 2014. Attack, Defence, and Contagion in Networks. The Review of Economic Studies 81, 4 (07 2014), 1518–1542. https://doi.org/10.1093/restud/rdu013 arXiv:https://academic.oup.com/restud/article-pdf/81/4/1518/18393865/rdu013.pdf
  13. Sergiu Hart. 2008. Discrete Colonel Blotto and general lotto games. International Journal of Game Theory 36, 3 (2008), 441–460.
  14. A survey on task assignment in crowdsourcing. ACM Computing Surveys (CSUR) 55, 3 (2022), 1–35.
  15. Rafael Hortala-Vallve and Aniol Llorente-Saguer. 2012. Pure strategy Nash equilibria in non-zero sum colonel Blotto games. International Journal of Game Theory 41 (2012), 331–343.
  16. Elias Koutsoupias and Christos Papadimitriou. 2009. Worst-case equilibria. Computer science review 3, 2 (2009), 65–69.
  17. Dan Kovenock and Brian Roberson. 2012. Coalitional Colonel Blotto games with application to the economics of alliances. Journal of Public Economic Theory 14, 4 (2012), 653–676.
  18. Dan Kovenock and Brian Roberson. 2021. Generalizations of the general lotto and colonel blotto games. Economic Theory 71 (2021), 997–1032.
  19. Jean-François Laslier and Nathalie Picard. 2002. Distributive Politics and Electoral Competition. Journal of Economic Theory 103, 1 (2002), 106–130. https://doi.org/10.1006/jeth.2000.2775
  20. math.stackexchange.com. 2015. Is the optimal solution of a strictly convex function over ℤdsuperscriptℤ𝑑\mathbb{Z}^{d}blackboard_Z start_POSTSUPERSCRIPT italic_d end_POSTSUPERSCRIPT a rounded version of its optimal solution over ℝdsuperscriptℝ𝑑\mathbb{R}^{d}blackboard_R start_POSTSUPERSCRIPT italic_d end_POSTSUPERSCRIPT. https://math.stackexchange.com/questions/1213609/is-the-optimal-solution-of-a-strictly-convex-function-over-mathbbzd-a-roun
  21. Kostyantyn Mazur. 2017. A Partial Solution to Continuous Blotto. arXiv preprint arXiv:1706.08479 (2017).
  22. In play: A commentary on strategies in the 2004 us presidential election. Public Choice 123 (2005), 19–37.
  23. Antonio Osorio. 2013. The lottery Blotto game. Economics Letters 120, 2 (2013), 164–166. https://doi.org/10.1016/j.econlet.2013.04.012
  24. Nicolas Pröllochs. 2022. Community-based fact-checking on Twitter’s Birdwatch platform. In Proceedings of the International AAAI Conference on Web and Social Media, Vol. 16. 794–805.
  25. Crowdsourced Fact-Checking at Twitter: How Does the Crowd Compare With Experts?. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 1736–1746.
  26. The heterogeneous colonel blotto game. In 2014 7th international conference on NETwork Games, COntrol and OPtimization (NetGCoop). IEEE, 232–238.
  27. The heterogeneous Colonel Blotto game. In 2014 7th International Conference on NETwork Games, COntrol and OPtimization (NetGCoop). 232–238.
  28. Stergios Skaperdas. 1996. Contest success functions. Economic theory 7 (1996), 283–290.
  29. Gordon Tullock. 2001. Efficient Rent Seeking. Springer US, Boston, MA, 3–16. https://doi.org/10.1007/978-1-4757-5055-3_2
  30. Birdwatch: Crowd Wisdom and Bridging Algorithms can Inform Understanding and Reduce the Spread of Misinformation. arXiv preprint arXiv:2210.15723 (2022).
  31. Taha Yasseri and Filippo Menczer. 2021. Can the Wikipedia moderation model rescue the social marketplace of ideas? (2021).
  32. Consensus algorithms for biased labeling in crowdsourcing. Information Sciences 382 (2017), 254–273.
  33. Yu Zhang and Mihaela van der Schaar. 2012. Reputation-based incentive protocols in crowdsourcing applications. In 2012 Proceedings IEEE INFOCOM. 2140–2148. https://doi.org/10.1109/INFCOM.2012.6195597
Citations (2)

Summary

We haven't generated a summary for this paper yet.