Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management

arXiv:2404.04467v1 Announce Type: cross
Abstract: This paper proposes a practically efficient algorithm with optimal theoretical regret which solves the classical network revenue management (NRM) problem with unknown, nonparametric demand. Over a time horizon of length $T$, in each time period the retailer needs to decide prices of $N$ types of products which are produced based on $M$ types of resources with unreplenishable initial inventory. When demand is nonparametric with some mild assumptions, Miao and Wang (2021) is the first paper …

abstract algorithm arxiv blind cs.lg demand horizon management network optimization paper primal revenue stat.ml type types