Research map / Bandits and online learning / Online convex optimization and games
Towards Safe and Optimal Online Bidding: A Modular Look-ahead Lyapunov Framework
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.89)
- Learning-Augmented Online Bidding in Stochastic Settings (NeurIPS 2025 · similarity 0.89)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.88)
- Online Learning under Budget and ROI Constraints via Weak Adaptivity (ICML 2024 · similarity 0.88)
- Online Resource Allocation With General Constraints (NeurIPS 2026 · similarity 0.87)
- Learning Bayesian Nash Equilibrium in Auction Games via Approximate Best Response (ICML 2025 · similarity 0.87)
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.