Research map / Bandits and online learning / Online convex optimization and games
Policy Regret in Repeated Games
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.
Closest papers by meaning
- Regret Analysis of Repeated Delegated Choice (AAAI 2024 · similarity 0.84)
- Convergence of No-Swap-Regret Dynamics in Self-Play (NeurIPS 2024 · similarity 0.82)
- Policy-Regret Minimization in Markov Games with Function Approximation (ICML 2025 · similarity 0.82)
- Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms (NeurIPS 2024 · similarity 0.82)
- The Value of Recall in Extensive-Form Games (AAAI 2025 · similarity 0.82)
- Optimism Without Regularization: Constant Regret in Zero-Sum Games (NeurIPS 2025 · similarity 0.82)
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.