Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
Authors
Keywords
Assortment problem, Envy-free pricing, Stackelberg games
Journal
ALGORITHMICA
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2019-08-13
DOI
10.1007/s00453-019-00610-8
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- The (Neural) Dynamics of Stochastic Choice
- (2018) Ryan Webb MANAGEMENT SCIENCE
- A Partial-Order-Based Model to Estimate Individual Preferences Using Panel Data
- (2018) Srikanth Jagabathula et al. MANAGEMENT SCIENCE
- The perception-adjusted Luce model
- (2018) Federico Echenique et al. MATHEMATICAL SOCIAL SCIENCES
- The Approximability of Assortment Optimization Under Ranking Preferences
- (2018) Ali Aouad et al. OPERATIONS RESEARCH
- Revenue Management Under the Markov Chain Choice Model
- (2017) Jacob B. Feldman et al. OPERATIONS RESEARCH
- Discrete choice models based on random walks
- (2016) Gerardo Berbeglia OPERATIONS RESEARCH LETTERS
- Assortment optimization under a multinomial logit model with position bias and social influence
- (2015) Andrés Abeliuk et al. 4OR-A Quarterly Journal of Operations Research
- Stochastic Choice and Revealed Perturbed Utility
- (2015) Drew Fudenberg et al. ECONOMETRICA
- Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits
- (2015) Jacob Feldman et al. PRODUCTION AND OPERATIONS MANAGEMENT
- Stochastic Choice and Consideration Sets
- (2014) ECONOMETRICA
- Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters
- (2014) Paat Rusmevichientong et al. PRODUCTION AND OPERATIONS MANAGEMENT
- A branch-and-cut algorithm for the latent-class logit assortment problem
- (2012) Isabel Méndez-Díaz et al. DISCRETE APPLIED MATHEMATICS
- Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
- (2012) Paat Rusmevichientong et al. OPERATIONS RESEARCH
- Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
- (2011) Patrick Briest et al. SIAM JOURNAL ON COMPUTING
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- (2010) Paat Rusmevichientong et al. OPERATIONS RESEARCH
- The Stackelberg Minimum Spanning Tree Game
- (2009) Jean Cardinal et al. ALGORITHMICA
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- (2009) Juan José Miranda Bront et al. OPERATIONS RESEARCH
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started