Bayesian Optimization for Dynamic Pricing and Learning
We study the dynamic pricing problem in which a seller, facing an unknown stochastic demand function, must adaptively choose prices to maximize cumulative revenue. The seller observes only noisy demand observations after posting prices, leading to the need for simultaneous learning of the demand model and the optimization of pricing decisions. Existing methods typically rely on parametric assumptions (e.g., polynomial or logit demand) and optimize using Iterative Least Squares or reinforcement learning (RL) algorithms. These approaches are vulnerable to model misspecification, slow convergence, and high variance under noise.
Authors
- Anush Anand
- Pranav Agrawal
Institutions
- Indian Institute of Technology Hyderabad (IN)
Publication Details
- Journal
- ACM SIGMETRICS Performance Evaluation Review
- Published
- 2026-03-31
- DOI
- https://doi.org/10.1145/3797823.3797833
- Primary Topic
- Advanced Bandit Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00