Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise
Jianyu Xu, Yu-Xiang Wang

TL;DR
This paper investigates feature-based dynamic pricing under minimal assumptions, proposing algorithms with regret bounds for two models: one competing with the best linear policy and another with unknown noise, showing learning is feasible but limited.
Contribution
It introduces two agnostic models for feature-based pricing, providing regret bounds and improving lower bounds, thus advancing understanding of learning under weak assumptions.
Findings
Achieves minimax regret of rac13 Trac23 for linear policy model
Provides an algorithm with rac34 Trac23 regret for noisy valuation model
Shows that richer feedback does not significantly improve regret bounds
Abstract
In feature-based dynamic pricing, a seller sets appropriate prices for a sequence of products (described by feature vectors) on the fly by learning from the binary outcomes of previous sales sessions ("Sold" if valuation price, and "Not Sold" otherwise). Existing works either assume noiseless linear valuation or precisely-known noise distribution, which limits the applicability of those algorithms in practice when these assumptions are hard to verify. In this work, we study two more agnostic models: (a) a "linear policy" problem where we aim at competing with the best linear pricing policy while making no assumptions on the data, and (b) a "linear noisy valuation" problem where the random valuation is linear plus an unknown and assumption-free noise. For the former model, we show a minimax regret up to logarithmic factors. For the latter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Smart Grid Energy Management · Machine Learning and Algorithms
