Research map / Learning theory and algorithms / Submodular and game algorithms
Revenue Maximization for Finitely Repeated Ad 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
- Reserve Price Optimization for First Price Auctions in Display Advertising (ICML 2021 · similarity 0.92)
- Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing (ICML 2021 · similarity 0.89)
- Robust Auction Design in the Auto-bidding World (NeurIPS 2021 · similarity 0.88)
- Sample Complexity of Posted Pricing for a Single Item (NeurIPS 2024 · similarity 0.87)
- Optimal Auction Design for Mixed Bidders (AAAI 2025 · similarity 0.86)
- Randomized Truthful Auctions with Learning Agents (NeurIPS 2024 · similarity 0.85)
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.