Research map / Learning theory and algorithms / Submodular and game algorithms
Learning Optimal Strategies to Commit To
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
- Learning in Structured Stackelberg Games (ICML 2026 · similarity 0.91)
- Safe Search for Stackelberg Equilibria in Extensive-Form Games (AAAI 2021 · similarity 0.90)
- Stackelberg Planning: Towards Effective Leader-Follower State Space Search (AAAI 2018 · similarity 0.90)
- Learning in Stackelberg Mean Field Games: A Non-Asymptotic Analysis (NeurIPS 2025 · similarity 0.89)
- Regret Minimization in Stackelberg Games with Side Information (NeurIPS 2024 · similarity 0.88)
- No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics (NeurIPS 2026 · similarity 0.86)
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.