We present tight bounds and heuristics for personalized, multi-product pricing problems. Under mild conditions we show that offering a non-personalize price in the direction of a positive vector (factor) has a tight profit guarantee relative to optimal personalized pricing. An optimal...

We address two important concerns faced by assortment managers, namely constrained assortment optimization and assortment personalization. We contribute to addressing these concerns by developing bounds and heuristics based on auxiliary multinomial logit (MNL) models. More precisely, we first...

We study the assortment optimization problem and show that local optima are global optima for all discrete choice models that can be represented by the Markov Chain model. We develop a forward greedy heuristic that finds an optimal assortment for the Markov Chain model and runs in $O(n^2)$...