atlas

Research map / Multi-agent systems and games / Games and equilibria

Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games

NeurIPS 2021 · Multi-agent systems and games › Games and equilibria · approach: Learning in Markov games · 11 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 a core set and weighted least squares instead of querying and estimating every action pairLearning Stackelberg in linear bandit games · Linear bandit gamessample complexity: \wt{O}(d^2/\eps^2) queries; lower bound \Omega(d/\eps^2)Helped
use reward-free RL exploration to estimate both rewards over the follower's near-optimal policy setLearning Stackelberg in bandit-RL games · Bandit-RL gamesepisodes: \wt{O}(H^5S^2AB/\varepsilon^2+H^7S^4AB/\varepsilon)Helped
use optimistic tie-breaking in simultaneous matrix gamesLearning Stackelberg in simultaneous matrix games · Simultaneous matrix gamesruntime: the same \wt{O}(AB/\varepsilon^2) sample complexityHelped

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