Pith. sign in

REVIEW 1 cited by

Context-Based Dynamic Pricing with Online Clustering

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.06199 v3 pith:VY6U5NFE submitted 2019-02-17 stat.ML cs.LG

classification stat.MLcs.LG
keywords pricingproductsclusteringdatademanddynamiconlinepolicies
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider a context-based dynamic pricing problem of online products, which have low sales. Sales data from Alibaba, a major global online retailer, illustrate the prevalence of low-sale products. For these products, existing single-product dynamic pricing algorithms do not work well due to insufficient data samples. To address this challenge, we propose pricing policies that concurrently perform clustering over product demand and set individual pricing decisions on the fly. By clustering data and identifying products that have similar demand patterns, we utilize sales data from products within the same cluster to improve demand estimation for better pricing decisions. We evaluate the algorithms using regret, and the result shows that when product demand functions come from multiple clusters, our algorithms significantly outperform traditional single-product pricing policies. Numerical experiments using a real dataset from Alibaba demonstrate that the proposed policies, compared with several benchmark policies, increase the revenue. The results show that online clustering is an effective approach to tackling dynamic pricing problems associated with low-sale products.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dynamic Pricing in the Linear Valuation Model using Shape Constraints

    stat.ML 2025-02 conditional novelty 6.0 of 10

    A shape-constrained dynamic pricing algorithm estimates the noise distribution via isotonic regression, achieving a ~O(T^{nu} d^{alpha/(alpha+2)}) regret bound under Holder continuity.

Pith tools