atlas

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

Function Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games

AAAI 2023 · Learning theory and algorithms › Submodular and game algorithms · approach: Correlated equilibria in sequential games · 1 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 EPF function approximation to compute SEFCEStackelberg games · Resource Collection (J=7, n=4)leader payoffHelped
Use EPF function approximation instead of subgame-perfect NashStackelberg games · Tantrum (n=25)leader payoffHelped
Use EPF function approximation instead of a non-strategic leader commitmentStackelberg games · Resource Collection+ (J=9, n=6)leader payoffHelped
Learn EPFs from state and payoff features across varying game parametersFeaturized Tantrum · Tantrum with varying q parameterspayoff ratio κHelped
Increase game horizon nEPF function approximation · Featurized Tantrumpayoff ratio κHurt
Test on out-of-distribution q valuesEPF function approximation · Featurized Tantrumpayoff ratio κMixed

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