AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Context-Based Dynamic Pricing with Partially Linear Demand Model

Jinzhi Bu, David Simchi-Levi, Chonghuan Wang

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 1 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
compare ADPLP against RPS and linear greedy algorithmsADPLP (DPLPE) · Simulated DPLPE, d=2, beta=1empirical relative regretImproved
decrease context dimension d from 10 to 3 to 1ADPLP · Simulated DPLPE, beta=1empirical relative regret: d in {1, 3, 10}Improved
increase Hölder smoothness beta from 0.2 to 0.4ADPLP · Simulated DPLPE, d=1empirical relative regret: beta = 0.2 to beta = 0.4Improved
increase beta from 0.6 to 1ADPLP · Simulated DPLPE, d=1empirical relative regret: beta = 0.6 and beta = 1No clear effect
compare ADPLC against linear greedy algorithmADPLC (DPLCE) · Simulated DPLCE, d=2, delta=3.75empirical relative regretImproved
decrease smoothness parameter delta from 3.75 to 2.5 to 1ADPLC · Simulated DPLCE, d=2empirical relative regret: 3.75, 2.5, 1Improved

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