Competitive Analysis for Online Leasing Problem with Compound Interest Rate

Article English OPEN
Xingyu Yang; Weiguo Zhang; Weijun Xu; Yong Zhang;

We introduce the compound interest rate into the continuous version of the online leasing problem and discuss the generalized model by competitive analysis. On the one hand, the optimal deterministic strategy and its competitive ratio are obtained; on the other hand, a ... View more
  • References (15)
    15 references, page 1 of 2

    Sleator, D. D., Tarjan, R. E.. Amortized efficiency of list update and paging rules. Communications of the ACM. 1985; 28 (2): 202-208

    Karlin, A. R., Manasse, M. S., Rudolph, L., Sleator, D. D.. Competitive snoopy caching. Algorithmica. 1988; 3 (1): 79-119

    Karlin, A. R., Manasse, M. S., McGeoch, L. A., Owicki, S.. Competitive randomized algorithms for nonuniform problems. Algorithmica. 1994; 11 (6): 542-571

    Karlin, A. R.. On the performance of competitive algorithms in practice. Online Algorithms. 1998; 1442: 373-384

    Karlin, A. R., Kenyon, C., Randall, D.. Dynamic TCP acknowledgment and other stories about e/(e−1). Algorithmica. 2003; 36 (3): 209-224

    El-Yaniv, R.. Competitive solutions for online financial problems. ACM Computing Surveys. 1998; 30 (1): 28-69

    Cover, T. M.. Universal portfolios. Mathematical Finance. 1991; 1 (1): 1-29

    El-Yaniv, R., Karp, R. M.. Nearly optimal competitive online replacement policies. Mathematics of Operations Research. 1997; 22 (4): 814-839

    Fleischer, R.. On the Bahncard problem. Theoretical Computer Science. 2001; 268 (1): 161-174

    Zhang, Y., Zhang, W.-G., Xu, W.-J., Yang, X.-Y.. A new risk-reward model for one-way online trading. Information. 2010; 13 (5): 1701-1709

  • Metrics
Share - Bookmark