Private Blotto: Viewpoint Competition with Polarized Agents
Kate Donahue, Jon M. Kleinberg
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 settingBorel [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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext fed0d425-2612-4fa0-a96d-d3d89c9fd3c7Cited by top-tier papers1
Ask how each one uses itBuilds on2
- Birds of a feather don't fact-check each other: Partisanship and the evaluation of news in Twitter's Birdwatch crowdsourced fact-checking programJennifer Allen, Cameron Martel, David G. RandCHI 2022 · 104 citations
- Double Oracle Algorithm for Computing Equilibria in Continuous GamesLukás Adam, Rostislav Horcík, Tomás Kasl, Tomás KroupaAAAI 2021 · 30 citations
Related papers
- Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately ManageableSina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua TengAAAI 2021 · 2 citations
- Equilibria of the Colonel Blotto Games with CostsStanislaw KazmierowskiAAAI 2025
- Will the Crowd Game the Algorithm?: Using Layperson Judgments to Combat Misinformation on Social Media by Downranking Distrusted SourcesZiv Epstein, Gordon Pennycook, David G. RandCHI 2020 · 68 citations
- Colonel Blotto with Battlefield GamesSalam Afiouni, Jakub Cerný, Chun Kai Ling, Christian KroerAAAI 2026
- Steering the Herd: A Framework for LLM-based Control of Social LearningRaghu Arghal, Kevin He, Shirin Saeedi Bidokhti, Saswati SarkarICLR 2026 · 1 citation
