Research map / Bandits and online learning / Online convex optimization and games
Learning Revenue Maximization Using Posted Prices for Stochastic Strategic Patient Buyers
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a price sequence instead of the best fixed price | Seller pricing in pure-price example D1 · Pure-price example D1 | expected revenue: 4/9 -> 2/3 | Helped |
| Randomize over price sequences instead of using a pure sequence | Seller pricing in mixed-price example D2 · Mixed-price example D2 | expected revenue: 4/9 -> 13/27 | Helped |
| Use a varying pure price sequence instead of a fixed price | Seller pricing when buyer value and patience are independent and value is regular · Independent value and patience, regular value distribution | expected revenue | No clear effect |
Closest papers by meaning
- Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer (ICML 2018 · similarity 0.90)
- Learning to Price Homogeneous Data (NeurIPS 2024 · similarity 0.88)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.87)
- Sample Complexity of Posted Pricing for a Single Item (NeurIPS 2024 · similarity 0.87)
- Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback (AAAI 2025 · similarity 0.87)
- Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search (ICML 2025 · 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.