Research map / Bandits and online learning / RL theory and MDPs
A Reinforcement Learning Approach in Multi-Phase Second-Price Auction Design
Rui Ai, Boxiang Lyu, Zhaoran Wang, Zhuoran Yang, Michael I. Jordan
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 CLUB instead of SCORP for reserve price learning | CLUB · Contextual bandit (H=1) | average regret: 178.96 -> 106.62 | Improved |
| use CLUB instead of NPAC-S | CLUB · Contextual bandit (H=1) | average regret: 99.69 vs 106.62; wins 15 vs 14 | No clear effect |
| use CLUB instead of NPAC-S in the MDP setting | CLUB · MDP (H=2) | average regret: 756.31 -> 203.07 | Improved |
Closest papers by meaning
- Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders (ICML 2020 · similarity 0.91)
- Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions (NeurIPS 2019 · similarity 0.90)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.88)
- Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization (NeurIPS 2025 · similarity 0.87)
- Randomized Truthful Auctions with Learning Agents (NeurIPS 2024 · similarity 0.87)
- Improved learning rates in multi-unit uniform price auctions (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.
