Papers › Online Assortment and Price Optimization Under Contextual Choice Models
Online Assortment and Price Optimization Under Contextual Choice Models
Yigit Efe Erginbas, Thomas A. Courtade, Kannan Ramchandran
We consider an assortment selection and pricing problem in which a seller has N different items available for sale. In each round, the seller observes a d-dimensional contextual preference information vector for the user, and offers to the user an assortment of K items at prices chosen by the seller. The user selects at most one of the products from the offered assortment according to a multinomial logit choice model whose parameters are unknown. The seller observes which, if any, item is chosen at the end of each round, with the goal of maximizing cumulative revenue over a selling horizon of length T. For this problem, we propose an algorithm that learns from user feedback and achieves a revenue regret of order O(d √(K T) / L₀ ) where L₀ is the minimum price sensitivity parameter. We also obtain a lower bound of order Ω(d √(T)/ L₀) for the regret achievable by any algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections