We consider a joint pricing and inventory control problem in which the customer's response to selling price and the demand distribution are not known a priori. Unsatisfied demand is lost and unobserved, and the only available information for decision-making is the observed sales data (a.k.a....

We study an online knapsack problem where the items arrive sequentially and must be either immediately packed into the knapsack or irrevocably discarded. Each item has a different size and the objective is to maximize the total size of items packed. We focus on the class of randomized algorithms...

We consider a price-based network revenue management problem where a retailer aims to maximize revenue from multiple products with limited inventory over a finite selling season. As common in practice, we assume the demand function contains unknown parameters, which must be learned from sales...

Motivated by the dynamic assortment offerings and item pricings occurring in e-commerce, we study a general problem of allocating finite inventories to heterogeneous customers arriving sequentially. We analyze this problem under the framework of competitive analysis, where the sequence of...