Assortment optimization under the perception-adjusted Luce model
Abstract
The Perception-Adjusted Luce Model (PALM) introduced by by Echenique et al. (2018) is a sequential choice model that can accommodate violations of regularity and choice overload, behaviors not captured by the utility-maximization framework. Flores et al. (2019) studied the assortment problem under the PALM and proved that, for the case of two levels, there is always an optimal solution that is revenue-ordered by level. They also conjectured that revenue-ordered by levels remain optimal for the general PALM with any number of levels. We resolve this question in the affirmative by showing that every PALM instance admits an optimal assortment that includes, within each level, all products at or above a level-specific revenue threshold. The proof involves first showing how the conjecture which deals with a discrete optimization problem, can be reduced to proving certain property of a related continuous optimization problem. Specifically, we study a continuous refinement of the assortment decision under the same PALM choice rule. Although the refinement permits partial utility selections, we prove it always has an optimum that selects complete revenue tiers. This allows us to show that the assortment problem is polynomial-time solvable when the number of levels is fixed.
Related
- A Unified Framework for Assortment Optimization and Matching under MNL Choice
- AI-Mediation in Retail Markets: Revenue Effects and Assortment Optimization
- The Value of Experiments in Assortment Optimization
- Inventory and Assortment Optimization under General Choice: A Unified Approximation Framework
- The longest increasing subsequences of Luce permutations and permutons
BibTeX
@misc{berbeglia2026assortment,
title = {{Assortment optimization under the perception-adjusted Luce model}},
author = {Gerardo Berbeglia and Mashbat Suzuki and Matthew Tam},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30904},
eprint = {2610.30904},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30904},
}
RIS
TY - UNPB
TI - Assortment optimization under the perception-adjusted Luce model
AU - Gerardo Berbeglia
AU - Mashbat Suzuki
AU - Matthew Tam
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.30904
UR - https://arxiv.org/abs/2610.30904
AB - The Perception-Adjusted Luce Model (PALM) introduced by by Echenique et al. (2018) is a sequential choice model that can accommodate violations of regularity and choice overload, behaviors not captured by the utility-maximization framework. Flores et al. (2019) studied the assortment problem under the PALM and proved that, for the case of two levels, there is always an optimal solution that is revenue-ordered by level. They also conjectured that revenue-ordered by levels remain optimal for the general PALM with any number of levels. We resolve this question in the affirmative by showing that every PALM instance admits an optimal assortment that includes, within each level, all products at or above a level-specific revenue threshold. The proof involves first showing how the conjecture which deals with a discrete optimization problem, can be reduced to proving certain property of a related continuous optimization problem. Specifically, we study a continuous refinement of the assortment decision under the same PALM choice rule. Although the refinement permits partial utility selections, we prove it always has an optimum that selects complete revenue tiers. This allows us to show that the assortment problem is polynomial-time solvable when the number of levels is fixed.
ER -