atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Voter Priming Campaigns: Strategies, Equilibria, and Algorithms

AAAI 2025 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies equilibria of campaign spending for issue priming in multi-issue, multi-party elections, proving pure equilibria exist for parliamentary settings and two-candidate cases, and that some presidential variants lack equilibria.

Problem

Strategic campaign budget allocation across issues to shift issue salience (priming) among multiple competing candidates/parties in parliamentary and presidential elections, and whether equilibria exist and can be computed.

Approach

Models priming as linear salience increases from investment, aggregates voters into per-issue rank scores so that equilibria can be computed in time linear in voters, and studies a game-theoretic spending competition under several presidential utility variants (indicator, indicator plus fraction, max of indicator and fraction).

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use parliamentary vote-share utility u_fracPriming game · Parliamentary electionspure Nash equilibrium existenceHelped
Restrict the parliamentary game to 2 candidatesu_frac priming game · Parliamentary elections, 2 candidatesfocused pure Nash equilibrium existenceHelped
Use presidential utility u_plus, which includes vote share alongside winningPriming game · Presidential elections, general caseNash equilibrium existenceHurt
Use presidential utility u_plus, which includes vote share alongside winningPriming game · Presidential elections, general casebest-response existenceHurt
Restrict the u_plus presidential game to 2 candidatesPriming game · Presidential elections, 2 candidatesfocused pure Nash equilibrium existenceHelped
Use presidential utility u_max, taking the maximum of winning utility and vote sharePriming game · Presidential elections, general caseNash equilibrium existenceHurt
Use presidential utility u_max, taking the maximum of winning utility and vote sharePriming game · Presidential elections, general casebest-response existenceMixed
Restrict the u_max presidential game to 2 candidatesPriming game · Presidential elections, 2 candidatesfocused pure Nash equilibrium existenceHelped
Use presidential utility u_ind, based only on the victory indicatorPriming game · Presidential elections, general casebest-response existenceHelped
Restrict the u_ind presidential game to 2 candidatesPriming game · Presidential elections, 2 candidatesfocused pure Nash equilibrium existenceHelped

Surprising findings

Limitations

Experimental setup

Metrics: utility of candidates vote share victory indicator

Builds on: spatial election models control by manipulation (priming) Nash's theorem

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy