atlas

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

Solving Large Sequential Games with the Excessive Gap Technique

NeurIPS 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics · 14 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 aggressive μ reduction with practical initial μ and μ balancing (ablation)EGT · Endgame 7iterations to 1mbb: about 3000 -> about 400Helped
Use aggressive μ reduction with practical initial μ and μ balancing (ablation)EGT · Endgame 2iterations to 1mbb: about 400 iterations for EGT/as; EGT is slowestMixed
Use EGT/as instead of CFR+River endgames · Endgame 2 and Endgame 7gradient computations to 1mbb: about 800 -> about 1800Hurt
Use practical EGT without aggressive μ reduction instead of CFR(RM) or CFR(RM$^+$)Endgame 7 · Endgame 7iterations to 1mbb: about 3000No clear effect
Use EGT/as instead of CFR(RM$^+$)River endgames · Endgame 2 and Endgame 7iterations to 1mbb: about 400 versus about 3000 in Endgame 7Helped

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