Search Results for author:
Found 4 papers, 0 papers with code
Bounds, Heuristics, and Prophet Inequalities for Assortment Optimization
For the price-aware MNL, however, a clairvoyant firm can earn at most $\exp(1)$ more than a traditional firm.
Bounds and Heuristics for Multi-Product Personalized Pricing
Numerical results are presented for a variety of demand models that illustrate the tradeoffs between using the economic factor and the robust factor for each cluster, as well as the tradeoffs between using a clustering heuristic with a worst case performance of two and a machine learning clustering algorithm.
The Refined Assortment Optimization Problem
We introduce the refined assortment optimization problem where a firm may decide to make some of its products harder to get instead of making them unavailable as in the traditional assortment optimization problem.
Interdependent Scheduling Games
We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently.
