Research map / Learning theory and algorithms / Submodular and game algorithms
Regret Minimization in Behaviorally-Constrained Zero-Sum 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
- Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium (NeurIPS 2019 · similarity 0.94)
- Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games (AAAI 2021 · similarity 0.94)
- Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games (AAAI 2019 · similarity 0.93)
- Strategy-Based Warm Starting for Regret Minimization in Games (AAAI 2016 · similarity 0.93)
- Stable-Predictive Optimistic Counterfactual Regret Minimization (ICML 2019 · similarity 0.92)
- Convergence of No-Swap-Regret Dynamics in Self-Play (NeurIPS 2024 · similarity 0.90)
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.