## Online Learning and Pricing for Network Revenue Management with Reusable Resources

### Huiwen Jia · Cong Shi · Siqian Shen

##### Hall J #942

Keywords: [ stochastic systems ] [ bandits ] [ pricing ] [ mixing times ] [ network ] [ queueing network ]

[ Abstract ]
[ [
Wed 30 Nov 9 a.m. PST — 11 a.m. PST

Abstract: We consider a price-based network revenue management problem with multiple products and multiple reusable resources. Each randomly arriving customer requests a product (service) that needs to occupy a sequence of reusable resources (servers). We adopt an incomplete information setting where the firm does not know the price-demand function for each product and the goal is to dynamically set prices of all products to maximize the total expected revenue of serving customers. We propose novel batched bandit learning algorithms for finding near-optimal pricing policies, and show that they admit a near-optimal cumulative regret bound of $\tilde{O}(J\sqrt{XT})$, where $J$, $X$, and $T$ are the numbers of products, candidate prices, and service periods, respectively. As part of our regret analysis, we develop the first finite-time mixing time analysis of an open network queueing system (i.e., the celebrated Jackson Network), which could be of independent interest. Our numerical studies show that the proposed approaches perform consistently well.

Chat is not available.