Motivated by online labor markets, we consider the online assortment optimization problem faced by a two-sided matching platform that hosts a set of suppliers waiting to match with a customer. Arriving customers are shown an assortment of suppliers, and may choose to issue a match request to one...

We introduce a new optimization model, dubbed the display optimization problem, that captures a common aspect of choice behavior, known as the framing bias. In this setting, the objective is to optimize how distinct items (corresponding to products, web links, ads, etc.) are being displayed to a...

In this paper, we consider the yet-uncharted assortment optimization problem under the Exponomial choice model, where the objective is to determine the revenue maximizing set of products that should be offered to customers. Our main algorithmic contribution comes in the form of a fully...

We consider the single-period joint assortment and inventory planning problem with stochastic demand and dynamic substitution across products, motivated by applications in highly differentiated markets, such as online retailing and airlines. This class of problems is known to be notoriously hard...

The main contribution of this paper is to provide best-possible approximability bounds for assortment planning under a general choice model, where customer choices are modeled through an arbitrary distribution over ranked lists of their preferred products, subsuming most random utility choice...

We study the joint assortment planning and inventory management problem, where stock-out events elicit dynamic substitution effects, described by the Multinomial Logit (MNL) choice model. Special cases of this setting have extensively been studied in recent literature, notably the static...

We study the dynamic assortment planning problem under the widely-utilized Multinomial Logit choice model (MNL). In this single-period assortment optimization and inventory management problem, the retailer jointly decides on an assortment, i.e., a subset of products to be offered, as well as on...

We study a generalized Pandora's box problem Weitzman (1979) in which boxes could be either (fully) opened for a certain fee to reveal their exact prizes, or partially opened at a reduced cost prior to being fully opened. This feature introduces a tradeoff where on one hand, partial opening...