Research map / Bandits and online learning / Online convex optimization and games
The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
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
- Improved Online Learning Algorithms for CTR Prediction in Ad Auctions (ICML 2023 · similarity 0.91)
- Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions (NeurIPS 2022 · similarity 0.90)
- No-Regret Online Autobidding Algorithms in First-price Auctions (NeurIPS 2025 · similarity 0.89)
- Learning Personalized Ad Impact via Contextual Reinforcement Learning under Delayed Rewards (NeurIPS 2025 · similarity 0.88)
- Dynamic Budget Throttling in Repeated Second-Price Auctions (AAAI 2024 · similarity 0.87)
- 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.