Revenue management and learning in systems of reusable resources

Abstract

Many problems in revenue management and operations management more generally can be framed as problems of resource allocation. This thesis focuses on developing policies and guarantees for resource allocation problems with reusable resources and on learning models for personalized resource allocation. First, we address the problem of pricing and assortment optimization for reusable resources under time-homogeneous demand. We demonstrate that a simple randomized policy achieves at least one half of the optimal revenue in both the pricing and assortment settings. Further, when prices are fixed a priori, we develop a method to compute the optimal randomized state-independent assortment policy. The performance of our policies is evaluated in numerical experiments based on arrival rate and parking time data from a municipal parking system. Though our algorithms perform well, our computational results suggest that dynamic pricing strategies are of limited value in the face of a consistent demand stream. Motivated in part by the computational results of the previous section, in the second section, we consider the problem of pricing and assortment optimization for reusable resource under time-varying demand. We develop a time-discretization strategy that yields a constant-factor performance guarantee relative to the optimal policy continuous-time policy. Additionally, we develop heuristic methods that implement a bid-price strategy between available resources based on pre-computed statistics that is computable in real-time. These methods effectively account for the future value of resources that in turn depend on the future patterns of demand. We validate our methods on arrival patterns derived from real arrival rate patterns in a parking context. In the third part, we consider the problem of learning contextual pricing policies more generally. We propose a framework for making personalized pricing decisions based on a multinomial logit model with features based on both customer attributes, item attributes, and their interactions. We demonstrate that our modeling procedure is coherent and in the well specified setting we demonstrate finite sample bounds on the performance of our strategy based on the size of the training data.