Combinatorial assortment optimization

DOI10.1007/978-3-030-04612-5_15zbMath1443.91196arXiv1711.02601OpenAlexW3162861602MaRDI QIDQ2190396

Christos Tzamos, Jieming Mao, Vasilis Syrgkanis, Nicole Immorlica, Brendan Lucier

Publication date: 18 June 2020

Full work available at URL: https://arxiv.org/abs/1711.02601

zbMATH Keywords

assortment optimizationchoice modelcomplexity of optimization problemhardness of combinatorial assortment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Consumer behavior, demand theory (91B42)

Related Items (1)

Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets

Cites Work

• A branch-and-cut algorithm for the latent-class logit assortment problem
• Gross substitutability: an algorithmic survey
• Combinatorial auctions with decreasing marginal utilities
• The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization
• Multi-parameter mechanism design and sequential posted pricing
• Assortment Optimization Under Variants of the Nested Logit Model
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• A Column Generation Algorithm for Choice-Based Network Revenue Management
• Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
• Learning Consumer Tastes Through Dynamic Assortments
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• On Maximizing Welfare When Utility Functions Are Subadditive

This page was built for publication: Combinatorial assortment optimization