Optimal online risk-tolerant ordering policy for the newsvendor with Forecast

Journal of Convergence Information Technology

Volumn 5, Issue 4, 2010, Pages

  Ma, Wei min ^a   Wang, Ke ^a  

^a TONGJI UNIVERSITY   (China)

Author keywords

Competitive analysis; Decision making with incomplete information; Newsvendor problem; Risk reward framework; Risk tolerant algorithm

Indexed keywords

COMPETITIVE ANALYSIS; DECISION MAKERS; DECISION-MAKING WITH INCOMPLETE INFORMATION; EXPECTED PROFITS; INCOMPLETE INFORMATION; LOWER BOUNDS; NEWSVENDOR PROBLEM; NEWSVENDORS; ONLINE STRATEGY; ORDER QUANTITY; ORDERING POLICIES; RISK TOLERANCE; UPPER BOUND;

FORECASTING; OPTIMIZATION; PROFITABILITY;

RISK PERCEPTION;

EID: 78651534172     PISSN: 19759320     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. S. Al-Binali, A Risk-Reward Framework for the Competitive Analysis of Financial Games, Algorithmica, 25(1), 1999, pp.99-115.
2. A. Borodin, R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, 1998.
3. F. Chen, M. Parlar, Value of a put option to the risk-averse newsvendor, HE Transactions, 39(5), 2007, pp.481-500.
4. F. Chen, H. Yan, L. Yao, A Newsvendor Pricing Game, IEEE Transactions on Systems, Man, Cybernetics, Part A, 34(4), 2004, pp.450-456.
5. S. Choi, A. Ruszczynski, A risk-averse newsvendor with law invariant coherent measures of risk, Operations Research Letters, 36, 2008, pp.77-82.
6. L. Ding, C. Xin, J. Chen, A Risk-Reward Competitive Analysis of the Bahncard Problem, In: N. Megiddo, Y. Xu, N. Alonstioti, B. Zhu (Eds.), Algorithmic Applications in Management, LNCS 3521, 2005, pp.37-45.
7. R. El-Yaniv, A. Fiat, R.M. Karp, G. Turpin, "Competitive analysis of financial games", In Proc. 33rd IEEE FOCS, 1992, pp.327-333.
8. A.R. Karlin, On the Performance of Competitive Algorithms in Practice, In: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms, LNCS 1442, 1998, pp.373-384.
9. M. Khouja, The single-period (news-vendor) problem: literature review and suggestions for future research, Omega, 27, 1999, pp.537-553.
10. B. Liu, W. Cui, C. Xin, Ordering Policy for Perishable Commodity Using Online Algorithm with Risk-Reward, In the Proceedings of 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007), 2007, doi:10.2991/iske.2007.109.
11. J. Lorenz, K. Panagiotou, A. Steger, Optimal Algorithms for k-Search with Application in Option Pricing, In: L. Arge, M. Hoffmann, and E. Welzl (Eds.), ESA 2007, LNCS 4698, 2007, pp.275-286.
12. W. Ma, J. You, Y. Xu, J. Liu, K. Wang, On the On-line Number of Snacks Problem, Journal of Global Optimization, 24(4), 2002, pp.449-462.
13. W.M. Ma, K. Wang, Robust Solutions to the Newsvendor Problem under the Perspective of Competitive Analysis, Proceedings of the 4th International Conference on New Trends in Information Science and Service Science (NISS 2010), May 11-13, 2010, Gyeongju, Korea, pp. 424-429.
14. I. Moon, S. Choi, The distribution free newsboy problem with balking, Journal of Operational Research Society, 46, 1995, pp.537-542.
15. M. Parlar, Z. Weng, Balancing desirable but conflicting objectives in the newsvendor problem, IIE Transactions, 35(2), 2003, pp.131-142.
16. D. Reyniers, A high-low search for a newsboy problem with delayed information feedback, Operations Research, 38(5), 1990, pp.838-846.
17. H. Scarf, A min-max solution of an inventory problem, In: K. Arrow, S. Karlin, H. Scarf (Eds.), Studies in the mathematical theory of inventory and production, Stanford, CA: Stanford University Press, 1958, pp.201-209.
18. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28(2), 1985, pp.202-208.
19. B. Su, Y. Xu, P. Xiao, L. Tian, A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem, In: B. Yang, D.Z. Du, C.A. Wang (Eds.), Combinatorial Optimization and Applications, LNCS 5165, 2008, pp.417-426.
20. T.M. Within, Inventory control and price theory, Management science, 2(1), 1955, pp.61-68.