Private Blotto: Viewpoint Competition with Polarized Agents
Kate Donahue, Jon M. Kleinberg
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper2
- 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 次
- Double Oracle Algorithm for Computing Equilibria in Continuous GamesLukás Adam, Rostislav Horcík, Tomás Kasl, Tomás KroupaAAAI 2021 · 被引用 30 次
相关 Paper
- Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately ManageableSina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua TengAAAI 2021 · 被引用 2 次
- 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 次
- 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 次
