atlas

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

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable

AAAI 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Correlated equilibria in sequential games · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use an approximate best-response algorithm and allow a constant-factor increase in troop useGeneral multifaceted Colonel Blotto games · General multifaceted Colonel Blotto gamesmaxmin payoff approximation: (O( ln(1/ϵ) ϵ ), ϵ)-maxminHelped
Exploit homogeneous battlegrounds and allow each troop to be used 1+ϵ timesSymmetric multifaceted Colonel Blotto games · Symmetric multifaceted Colonel Blotto gamesmaxmin payoff approximation: (1+ϵ, 0)-maxminHelped
Reduce maxmin computation to approximate best-response computation using the Ellipsoid methodHuge constant-sum games · Multifaceted Colonel Blotto gamesmaxmin payoff approximation: (α, 2·(1−1/β))Helped
Use multifaceted, battleground-dependent resource strengths rather than homogeneous troopsMultifaceted Colonel Blotto games · Multifaceted Colonel Blotto gamesbest-response approximation feasibilityHurt

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