AI Paper Atlas

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

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
add monotonicity (markdown) constraint to dynamic pricing at markdown dimension 1dynamic pricing policy · Lipschitz unimodal demand, s=2regret rate: T^2/3 -> T^3/4Hurt
assume a parametric demand family with finite markdown dimension d<1 instead of nonparametricmarkdown pricing · s=2regret rate: T^3/4 -> T^d/(d+1)Improved
parametric family with markdown dimension d = 0markdown pricing · s=2regret rate: Theta(log^2 T) vs Theta(log T)Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy