Research map / Bandits and online learning / Online convex optimization and games
No-Regret Online Prediction with Strategic Experts
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
- Online Prediction with Selfish Experts (NeurIPS 2017 · similarity 0.93)
- Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making (NeurIPS 2025 · similarity 0.88)
- Online Learning in Betting Markets: Profit versus Prediction (ICML 2024 · similarity 0.87)
- When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses (NeurIPS 2025 · similarity 0.87)
- Managing Self-Learning Experts under Per-Round Budget Constraints (NeurIPS 2026 · similarity 0.87)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · 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.