Network Revenue Management (NRM) describes a general online allocation problem in which combinations of capacity-constrained resources are sold to a stream of arriving customers. Existing papers propose one-size-fits-all approaches for controlling the capacities of these different resources over...

Problem definition: We study the dynamic fulfillment problem in e-commerce, in which incoming (multi-item) customer orders must be immediately dispatched to (a combination of) fulfillment centers that have the required inventory. Methodology/results: A prevailing approach to this problem,...

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...

In this paper, we consider a personalized assortment planning problem under inventory constraints, where the type of each arriving customer is defined by a primary item of interest. As long as that item is in stock, the customer adds it to her shopping cart, at which point the retailer can...

This work is motivated by our collaboration with a large consumer packaged goods (CPG) company. We have found that while the company appreciates the advantages of dynamic pricing, they deem it operationally much easier to plan out a static price calendar in advance.We investigate the efficacy of...