atlas

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

Double-Oracle Sampling Method for Stackelberg Equilibrium Approximation in General-Sum Extensive-Form Games

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics

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 O2UCT instead of MILP-based methods on larger WHG and WNZ instancesStackelberg equilibrium approximation · WHG and WNZ, 10^7-node bucketgame instances solved within 200h: O2UCT solved all game instances; CBK2018(a) solved 23 WHG and 13 WNZ gamesHelped
Use O2UCT instead of solver-based methodsStackelberg equilibrium approximation · General game instancesmaximum game nodes computed: 10^9 game nodes using 8GB; solver based methods started running out of 256GB for games with 10^7 nodesHelped
Use O2UCT instead of MILP-based methods on small gamesStackelberg equilibrium approximation · WHG, WNZ, and SEG small instancescomputation timeHurt
Use O2UCT instead of MILP-based methods on larger gamesStackelberg equilibrium approximation · WHG, WNZ, and SEG large instancescomputation timeHelped
Use O2UCT instead of CBK2018 variantsStackelberg equilibrium approximation · WHG, WNZ, and SEGLeader's payoffHelped

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