Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
By A. Gürhan Kök, Marshall L. Fisher. Operational Research, 2007
462 citations recorded by the source corpus.
Subfields: Management Information Systems, Marketing
View Paper: https://www.semanticscholar.org/paper/24321c4634f53f81e0f6e1f6adcf877fdf66a6f4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Management Information Systems
- Paat Rusmevichientong
- David B. Shmoys
- Zhaolin Li
- Zuo-Jun Max Shen
- Lingxiu Dong
- Zhongjun Tian
- Huseyin Topaloglu
- Panos Kouvelis
In Marketing
- Paat Rusmevichientong
- David B. Shmoys
- Zhaolin Li
- Zuo-Jun Max Shen
- Lingxiu Dong
- Zhongjun Tian
- Huseyin Topaloglu
- Panos Kouvelis
Citations in the corpus
- Joint Stocking and Product Offer Decisions Under the Multinomial Logit Model (2013, background): “Kok and Fisher (2007) study dynamic substitution under the multi-nomial logit model and propose methods for estimating choice model parameters and making stocking decisions.”
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint (2010, methodology): “in a multiarmed bandit problem (with a total of O(N2) arms), and apply generic all-purpose multiarmed bandit algorithms (for example, Lai and Robbins (1985) and Auer et al.”
- Dynamic Pricing and Inventory Control of Substitute Products (2009, background): ““AAA” world-class supply chain practitioners (see Lee (2004)), and in their ranks are companies such as Seven-Eleven Japan, Zara, Amazon and Dell.”
- Integration of Online and Offline Channels in Retail: The Impact of Sharing Reliable Inventory Availability Information (2014, unknown): “This has been studied in papers by, for example, Kok and Fisher (2007) and Musalem et al. (2012).”
- A Single‐Period Assortment Optimization Model (2007, background): “…S affect the demand variability of D j ( S ) and the profitability of each variant, we need to evaluate every feasible solu-tion (totally 2 n (cid:2) 1 combinations) to find the optimal assortment, which is impractical (see the discussions in Mahajan and van Ryzin 2001a; Ko¨k and Fisher 2006).”