Problem definition: Today’s supply chains use multiple tiers, locations, and shipping speeds to better serve customers. In practice, these supply chains also face a key challenge of the possibility of a disruption (from a variety of sources), which typically limits inventory availability. We,...

We study a general problem of allocating limited resources to heterogeneous customers over time, under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically consumes some combination of resources, and returns different rewards for the...

We propose one of the first models of "product framing" and pricing. Product framing refers to the way consumer choice is influenced by how the products are framed, or displayed. We present a model where a set of products are displayed, or framed, into a set of virtual web pages. We assume that...

We study in this paper an online matching problem where a central platform needs to match a number of limited resources to different groups of users that arrive sequentially over time. The reward of each matching option depends both on the type of resource and the time period the user arrives....

The recent rising popularity of ultra-fast delivery services on retail platforms fuels the increasing use of urban warehouses, whose proximity to customers makes fast deliveries viable. The space limit in urban warehouses poses a problem for the online retailers: the number of products (SKUs)...

We study the canonical quantity-based network revenue management (NRM) problem where the decision-maker must irrevocably accept or reject each arriving customer request with the goal of maximizing the total revenue given limited resources. The exact solution to the problem by dynamic programming...

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

One of the main results of “Robust Contract Designs: Linear Contracts and Moral Hazard” by Yu and Kong (2020) is Proposition 4, which states that the optimal robust contract with a piecewise linear concave agent utility only consists of progressive fixed payments and linear rewards with...

Stochastic inventory systems with lead times are often challenging to optimize, including single-sourcing lost-sales and dual-sourcing inventory systems. Recent numerical results have suggested that capped policies demonstrate superior performance over existing heuristics. However, the superior...

Single-sourcing lost-sales inventory systems with lead times are notoriously difficult to optimize. In this work, we propose a new family of capped base-stock policies and provide a new perspective of constructing a practical hybrid policy combining two well-known heuristics: base-stock and...