Research map / Bandits and online learning / Online convex optimization and games
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing
Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh
Read the paperCheck your idea against 137,217 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
- A Bandit Learning Algorithm and Applications to Auction Design (NeurIPS 2020 · similarity 0.91)
- Improved Online Learning Algorithms for CTR Prediction in Ad Auctions (ICML 2023 · similarity 0.91)
- Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback (AAAI 2025 · similarity 0.90)
- No-Regret Online Autobidding Algorithms in First-price Auctions (NeurIPS 2025 · similarity 0.89)
- Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization (NeurIPS 2025 · similarity 0.89)
- Online Learning under Budget and ROI Constraints via Weak Adaptivity (ICML 2024 · similarity 0.89)
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.
