atlas

Research map / Bandits and online learning / Online convex optimization and games

Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games

ICML 2019 · Bandits and online learning › Online convex optimization and games · approach: Last-iterate convergence in games · 13 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
Each player independently minimizes its own regret (naive OCO reduction) instead of jointly targeting NE regretOnline Matrix Games with adversarial payoffs · Online Matrix Games (theoretical)NE regret sublinearHurt
Use joint saddle-point updates with negative-entropy regularization (log dependence on action count)Online Matrix Games full information (OMG-RFTL) · Full information Online Matrix GamesNE regret boundHelped
Bandit feedback: one-point unbiased matrix estimate with joint randomization of both players' actions, combined with saddle-point RFTLBandit Online Matrix Games (BANDIT-OMG-RFTL) · Bandit Online Matrix GamesNE regret boundHelped

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