Research map / Bandits and online learning / Online convex optimization and games
Online Ad Procurement in Non-stationary Autobidding Worlds
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
- No-Regret Online Autobidding Algorithms in First-price Auctions (NeurIPS 2025 · similarity 0.87)
- Learning Personalized Ad Impact via Contextual Reinforcement Learning under Delayed Rewards (NeurIPS 2025 · similarity 0.86)
- AuctionNet: A Novel Benchmark for Decision-Making in Large-Scale Games (NeurIPS 2024 · similarity 0.86)
- Dynamic Budget Throttling in Repeated Second-Price Auctions (AAAI 2024 · similarity 0.86)
- Online Resource Allocation with Non-Stationary Customers (ICML 2024 · similarity 0.86)
- Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits (NeurIPS 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.