Research map / Bandits and online learning / Online convex optimization and games
Online Pricing with Strategic and Patient Buyers
Michal Feldman, Tomer Koren, Roi Livni, Yishay Mansour, Aviv Zohar
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 |
|---|---|---|---|
| Restrict seller to changing posted price only O(T^{2/3}) times via epochs with EXP3 chosen price per epoch | posted-price online pricing with patient buyers · adversarial buyers, regret vs best fixed price | regret | Improved |
| Patience increased from zero to one (windows of size >1 allowed) | posted-price pricing regret rate · adversarial buyers with two prices | optimal regret rate | Hurt |
| Running standard EXP3 directly on posted prices with patient buyers | naive bandit pricing · buyers with window size two | revenue | Hurt |
Closest papers by meaning
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.86)
- Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time (NeurIPS 2026 · similarity 0.86)
- Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback (AAAI 2025 · similarity 0.85)
- Contextual Dynamic Pricing with Heterogeneous Buyers (NeurIPS 2025 · similarity 0.85)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.85)
- Adaptive Market Making with Inventory Constraints via Online Learning (AAAI 2025 · 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.
