Research map / Bandits and online learning / Online convex optimization and games
Learning in Structured Stackelberg 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 Minimization in Stackelberg Games with Side Information (NeurIPS 2024 · similarity 0.91)
- Learning in Stackelberg Mean Field Games: A Non-Asymptotic Analysis (NeurIPS 2025 · similarity 0.90)
- Learning in Online Principal-Agent Interactions: The Power of Menus (AAAI 2024 · similarity 0.88)
- The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability (ICML 2025 · similarity 0.88)
- Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions (NeurIPS 2024 · similarity 0.88)
- No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics (NeurIPS 2026 · similarity 0.88)
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.