Research map / Bandits and online learning / Online convex optimization and games
A Study of Compact Reserve Pricing Languages
MohammadHossein Bateni, Hossein Esfandiary, Vahab Mirrokni, Saeed Seddighin
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use multiplicative reserve prices (iterative algorithm) instead of per-impression unrestricted reserves | reserve pricing on AdX data · AdX bids, 18 data sets | revenue vs unrestricted optimum: 94% | Improved |
| use a single uniform reserve price instead of the iterative multiplicative algorithm | reserve pricing on AdX data · AdX bids, 18 data sets | average revenue loss: 40% | Hurt |
| compare practical revenue loss to theoretical O(log R) bound | iterative algorithm · AdX bids | revenue loss | Improved |
Closest papers by meaning
- Maximizing the Success Probability of Policy Allocations in Online Systems (AAAI 2024 · similarity 0.86)
- Sample Complexity of Posted Pricing for a Single Item (NeurIPS 2024 · similarity 0.85)
- LLM-Auction: Generative Auction towards LLM-Native Advertising (NeurIPS 2026 · similarity 0.85)
- Optimal Auction Design for Mixed Bidders (AAAI 2025 · similarity 0.85)
- Optimal Auction Design in the Joint Advertising (ICML 2025 · similarity 0.84)
- Ad Auctions for LLMs via Retrieval Augmented Generation (NeurIPS 2024 · similarity 0.84)
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.
