Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand
DOI10.1002/nav.21902zbMath1529.91046OpenAlexW3017448023MaRDI QIDQ6072149
Unnamed Author, L. Jeff Hong, Unnamed Author
Publication date: 12 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21902
stochastic approximationrevenue managementKiefer-Wolfowitz algorithmdynamic pricing and learningnonparametric pricing policy
Nonparametric estimation (62G05) Stochastic programming (90C15) Microeconomic theory (price theory and economic markets) (91B24) Stochastic approximation (62L20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Non-Stationary Stochastic Optimization
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
- Dynamic Pricing Under a General Parametric Choice Model
- Robust Stochastic Approximation Approach to Stochastic Programming
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- On Incomplete Learning and Certainty-Equivalence Control
- Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
- Stochastic Convex Optimization with Bandit Feedback
- Stochastic Approximation of Minima with Improved Asymptotic Speed
- Chasing Demand: Learning and Earning in a Changing Environment
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
This page was built for publication: Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand