To wait or not to wait? Analysis for the traveler's waiting problem with incomplete information

Proceedings - 4th International Conference on Networked Computing and Advanced Information Management, NCM 2008

Volumn 2, Issue , 2008, Pages 726-731

  Wang, Ke ^a,b   Liu, James N K ^b   Ma, Wei Min ^a  

^a TONGJI UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; MANAGEMENT INFORMATION SYSTEMS; SEMICONDUCTOR STORAGE;

AVERAGE CASES; COMPETITIVE ANALYSIS; GENERAL VERSIONS; INCOMPLETE INFORMATIONS; ONLINE STRATEGIES;

INFORMATION MANAGEMENT;

EID: 57849116939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCM.2008.16     Document Type: Conference Paper

References (13)

1. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules, Communication of the ACM 28, (1985), pp. 202-208.
2. R. El-Yaniv, A. Fiat, R. M. Karp and G. Turpin. Competitive analysis of financial games, In Proc. 33rd IEEE FOCS, (1992), pp. 327-333.
3. R. Karp. On-line algorithms versus offline algorithms: How Much is it Worth to Know the Future?, In Proc. IFIP 12thWorld Computer Congress, (1992) Vol.1, pp. 416-429.
4. A. R. Karlin, M. S. Manasse, L. A. McGeoch and S. Owicki. Competitive randomized algorithms for non-uniform problems. Algorithmica, Vol.11, No.6, (1994), pp. 542-571.
5. H. Fujiwara and K. Iwama. Average-case Competitive Analyses for Ski-rental Problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 476-488. Springer, Heidelberg (2002)
6. H. Fujiwara and K. Iwama. Average-case Competitive Analyses for Ski-rental Problems. Algorithmica, Vol. 42, No. 1, (2005), pp. 95-107.
7. A. R. Karlin, C. Kenyon and D. Randall. Dynamic TCP Acknowledgement and Other Stories about e/(e-1). In: Proc. STOC '01, (2001), pp. 502-509.
8. R. Fleischer. On the Bahncard Problem, In: Proc. TCS'01, (2001), pp. 161-174.
9. A. Borodin and R. El-Yaniv. Online computation and competitive analysis, Cambridge University Press, 1998.
10. A. R. Karlin. On the Performance of Competitive Algorithms in Practice. Lecture Notes In Computer Science, Vol. 1442, (1998), pp. 373-384.
11. A. Wald. Statistical Decision Functions, New York: Wiley, 1950.
12. M. S. Manasse, L. A. McGeoch and D. D. Sleator. Competitive algorithms for on-line problems. In Proc. 20th Annual ACM Symposium on Theory of Computing, (1988) pp. 322-333.
13. C. L. Xin, W. M. Ma and F. L. Yi. Average-Case Analysis for Special Cases of Online Bahncard Problem. In Proc. 4th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, (2007), pp. 357-361.