Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 49-63

  O'Neil, Shawn ^a   Chaudhary, Amitabh ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

E-LEARNING; LEARNING ALGORITHMS; LEARNING SYSTEMS;

CONDITION; FOLLOW THE PERTURBED LEADER; MACHINE LEARNING ALGORITHMS; MULTI-PERIOD; NEWSVENDOR PROBLEM; ONLINE LEARNING ALGORITHMS; PROBLEM-BASED; STOCHASTIC APPROACH; THEORETICAL BOUNDS; TWO MACHINES;

STOCHASTIC SYSTEMS;

EID: 58349113832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.5     Document Type: Conference Paper

References (22)

1. R. Armstrong, D. Freitag, T. Joachims, and T. Mitchell. Webwatcher: A learning apprentice for the world wide web. In 1995 AAAI Spring Symposium on Information Gathering from Heterogeneous Distributed Environments, 1995.
2. E. Barnes, J. Dai, S. Deng, D. Down, M. Goh, H. C. Lau, and M. Sharafali. Electronics manufacturing service industry. The Logistics Institute-Asia Pacific, Georgia Tech and The National University of Singapore, Singapore, 2000.
3. D. Bertsimas and A. Thiele. A data driven approach to newsvendor problems. Technical report, Massechusetts Institute of Technology, Cambridge, MA, 2005.
4. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
5. A. O. Brown and C. S. Tang. The single-period inventory problem: A new perspective. Decisions, Operations, and Technology Management, 2000.
6. S.E. Chick, H. Mamani, and D. Simchi-Levi. Supply chain coordination and the influenza vaccination. In Manufacturing and Service Operations Management. Institute for Operations Research and the Management Sciences, 2006.
7. T. M. Cover and E. Ordentlich. On-line portfolio selection. In Proceedings of the ninth annual conference on Computational Learning Theory, pages 310-313, 1996.
8. T. M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2), 1996.
9. P. Demarzo, I. Kremer, and Y. Mansour. Online trading algorithms and robust option pricing. In Proceedings of the thirty-eighth annual AMC Symposium on Theory of Computing, pages 477-486, 2006.
10. F. Y. Edgeworth. The mathematical theory of banking. Journal of the Royal Statistical Society, 1888.
11. G. Gallego. Ieor 4000: Production management lecture notes. Available as http://www.Columbia.edu/~gmg2/4000/pdf/lect-07.pdf.
12. A. Kalai and S. Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291-307, 2005.
13. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, pages 285-318, 1988.
14. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, pages 212-261, 1994.
15. E. L. Porteus. Foundations of Stochastic Inventory Theory. Stanford University Press, Stanford, CA, 2002.
16. A. Raman and M. Fisher. Reducing the cost of demand uncertainty through accurate response to early sales. Operations Research, 44(4):87-99, January 1996.
17. L. J. Savage. The theory of statistical decisions. Journal of the American Statistical Association, 46:55-67, 1951.
18. H. E. Scarf. A min-max solution of an inventory problem. In Stanford University Press, 1958.
19. Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652-686, 1985.
20. Eiji Takimoto and Manfred K. Warmuth. Path kernels and multiplicative updates. J. Mach. Learn. Res., 4:773-818, 2003.
21. C. L. Vairaktarakis. Robust multi-item newsboy models with a budget constraint. International Journal of Production Economics, pages 213-226, 2000.
22. G. Yu. Robust economic order quantity models. European Journal of Operations Research, 100(3):482-493, 1997.