Research map / Bandits and online learning / Online convex optimization and games
Prior-independent Dynamic Auctions for a Value-maximizing Buyer
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
- A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions (NeurIPS 2019 · similarity 0.92)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.88)
- Optimal Auction Design for Mixed Bidders (AAAI 2025 · similarity 0.88)
- No-Regret Online Autobidding Algorithms in First-price Auctions (NeurIPS 2025 · similarity 0.88)
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.87)
- Fair Allocation in Dynamic Mechanism Design (NeurIPS 2024 · 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.