Research map / Bandits and online learning / Online convex optimization and games
Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model
Su Jia, Andrew A Li, Ramamoorthi Ravi
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 |
|---|---|---|---|
| add monotonicity (markdown) constraint to dynamic pricing at markdown dimension 1 | dynamic pricing policy · Lipschitz unimodal demand, s=2 | regret rate: T^2/3 -> T^3/4 | Hurt |
| assume a parametric demand family with finite markdown dimension d<1 instead of nonparametric | markdown pricing · s=2 | regret rate: T^3/4 -> T^d/(d+1) | Improved |
| parametric family with markdown dimension d = 0 | markdown pricing · s=2 | regret rate: Theta(log^2 T) vs Theta(log T) | Improved |
Closest papers by meaning
- Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand (NeurIPS 2026 · similarity 0.87)
- Learning to price with resource constraints: from full information to machine-learned prices (NeurIPS 2025 · similarity 0.85)
- Transfer Learning for Nonparametric Contextual Dynamic Pricing (ICML 2025 · similarity 0.85)
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.85)
- Contextual Dynamic Pricing with Heterogeneous Buyers (NeurIPS 2025 · similarity 0.84)
- Transfer Faster, Price Smarter: Minimax Dynamic Pricing under Cross-Market Preference Shift (NeurIPS 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.
