AI Paper Atlas

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

Computing Quantal Stackelberg Equilibrium in Extensive-Form Games

AAAI 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Correlated equilibria in sequential games · 3 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
Replace direct COBYLA optimization with the Dinkelbach-type MILP algorithmQSE computation in extensive-form games · Search Game, 4 stepsrelative solution-quality advantage over COBYLA: 16.23% ± 3.77%; 18.24% ± 3.14%; -1.98% ± 4.91%Mixed
Replace direct COBYLA optimization with the Dinkelbach-type MILP algorithmQSE computation in extensive-form games · Network Games 01–03relative solution-quality advantage over COBYLA: 2.83% ± 0.46%; 3.84% ± 0.74%; 2.32% ± 0.92%; 13.32% ± 7.35%; 8.87% ± 3.47%; 3.74% ± 4.05%; 1.09% ± 0.27%; 5.73% ± 1.85%;Helped
Use the Dinkelbach-type algorithm rather than COBYLAQSE computation in extensive-form games · Larger game instancesruntime: 3.5 hours; three daysHelped

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