Show simple item record

dc.contributor.advisorDavid Simchi-Levi.en_US
dc.contributor.authorNambiar, Mila.en_US
dc.contributor.otherMassachusetts Institute of Technology. Operations Research Center.en_US
dc.date.accessioned2020-02-10T21:38:16Z
dc.date.available2020-02-10T21:38:16Z
dc.date.copyright2019en_US
dc.date.issued2019en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/123720
dc.descriptionThesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2019en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 167-171).en_US
dc.description.abstractFashion retail is typically characterized by (1) high demand uncertainty and products with short life cycles, which complicates demand forecasting, and (2) low salvage values and long supply lead times, which penalizes for inaccurate demand forecasting. In this thesis, we are interested in the design of algorithms that leverage fashion retail data to improve demand forecasting, and that make revenue-maximizing or cost-minimizing pricing and inventory management decisions. First, we study a multi-period dynamic pricing problem with feature information. We are especially interested in demand model misspecification, and show that it can lead to price endogeneity, and hence inconsistent price elasticity estimates and suboptimal pricing decisions. We propose a "random price shock" (RPS) algorithm that combines instrumental variables, well known in econometrics, with online learning, in order to simultaneously estimate demand and optimize revenue.en_US
dc.description.abstractWe demonstrate strong theoretical guarantees on the regret of RPS for both IID and non ID features, and numerically validate the algorithm's performance on synthetic data. Next, we present a case study in collaboration with Oracle Retail. We extend RPS to incorporate common business constraints such as markdown pricing and inventory constraints. We then conduct a counterfactual analysis where we simulate the algorithm's performance using fashion retail data. Our analysis estimates that the RPS algorithm will increase by 2-7% relative to current practice. Finally, we study an inventory allocation problem in a single-warehouse multiple-retailer setting with lost sales. We show that under general conditions this problem is convex, and that a Lagrangian relaxation-based approach can be applied to solve it in a computationally tractable, and near-optimal way.en_US
dc.description.abstractThis analysis allows us to prove structural results that give insights into how the allocation policy should depend on factors such as the retailer demand distributions, and demand learning.en_US
dc.description.statementofresponsibilityby Mila Nambiar.en_US
dc.format.extent171 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectOperations Research Center.en_US
dc.titleData-driven pricing and inventory management with applications in fashion retailen_US
dc.typeThesisen_US
dc.description.degreePh. D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Centeren_US
dc.contributor.departmentSloan School of Management
dc.identifier.oclc1138022422en_US
dc.description.collectionPh.D. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Centeren_US
dspace.imported2020-02-10T21:38:15Zen_US
mit.thesis.degreeDoctoralen_US
mit.thesis.departmentSloanen_US
mit.thesis.departmentOperResen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record