atlas

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

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization

ICML 2023 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics · 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 team belief DAG (TB-DAG) representation with CFR instead of LP/column generationadversarial team games · Liar's Dice, Kuhn, Leduc team games (Table 1)runtime to eps=1e-3 exploitability: generally 2-3 orders of magnitude faster than ZS22Helped
use TB-DAG CFR instead of single-oracle column generation (ZFCS22)adversarial team games with high parameters · 3K8, 3K12runtimeHurt
use TB-DAG CFR instead of column generation (ZFCS22)adversarial team games with low parameter k · 3-player Leduc/Liar's Diceruntime: several orders of magnitude faster in games with low kHelped
public observations instead of public states in the DAG construction (no inflation needed)TB-DAG construction · theoretical construction familyTB-DAG sizeHelped

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