Technical note: Finite‐time regret analysis of Kiefer‐Wolfowitz stochastic approximation algorithm and nonparametric multi‐product dynamic pricing with unknown demand

L. Jeff Hong, Chenghuai Li and Jun Luo

Naval Research Logistics (NRL), 2020, vol. 67, issue 5, 368-379

Abstract: We consider the problem of nonparametric multi‐product dynamic pricing with unknown demand and show that the problem may be formulated as an online model‐free stochastic program, which can be solved by the classical Kiefer‐Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by κ1T+κ2 where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, …. Therefore, the regret of the KWSA algorithm grows in the order of T, which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.

Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.21902

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:67:y:2020:i:5:p:368-379

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().