Network revenue management with online inverse batch gradient descent method

We consider a general class of price‐based network revenue management problems that a firm aims to maximize revenue from multiple products produced with multiple types of resources endowed with limited inventory over a finite selling season. A salient feature of our problem is that the firm does not know the underlying demand function that maps prices to demand rate, which must be learned from sales data. It is well known that for almost all classes of demand functions, such as linear, exponential, multinomial logit, and nested logit models, the revenue rate function is not concave in the products' prices but is concave in products' market shares (or price‐controlled demand rates). This creates challenges in adopting any stochastic gradient descent based methods in the price space. We propose a novel nonparametric learning algorithm termed the online inverse batch gradient descent (IGD) algorithm. This algorithm proceeds in batches. In each batch, the firm implements each product's perturbed prices and then uses the sales information to estimate the market shares. Leveraging these estimates, the firm carries out a stochastic gradient descent step in the market share space that takes into account the relative inventory scarcity for the entire horizon and then inversely maps the updated market shares back to the price space to obtain the prices for the next batch. Moreover, we also propose an inventory‐adjusted algorithm (IGD‐I) that the feasible market share set is dynamically adjusted to capture the real‐time relative inventory scarcity for the remaining season. For the large‐scale systems wherein all resources' inventories and the length of the horizon are proportionally scaled by a parameter k, we establish a dimension‐independent regret bound of O (k 4 / 5 log k) O (k^4/5 k). This result is independent of the number of products and resources and works for a continuum action‐set prices and the demand functions that are only once differentiable. Our theoretical result guarantees the efficacy of both algorithms in the high‐dimensional systems where the number of products or resources is large and the prices are continuous. Our algorithms also numerically outperform the existing algorithms in the literature.