Nearly Optimal Competitive Online Replacement Policies

@article{ElYaniv1997NearlyOC,
  title={Nearly Optimal Competitive Online Replacement Policies},
  author={Ran El-Yaniv and Richard M. Karp},
  journal={Math. Oper. Res.},
  year={1997},
  volume={22},
  pages={814-839}
}
This paper studies the following online replacement problem. There is a real function f(t), called the ow rate, deened over a nite time horizon 0; T]. It is known that m f(t) M for some reals 0 m < M. At time 0 an online player starts to pay money at the rate f(0). At each time 0 < t T the player may changeover and continue paying money at the rate f(t). The complication is that each such changeover incurs some xed penalty. The player is called online as at each time t the player knows f only… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Optimum pricing policy under stochastic in ation

  • E. Sheshinski, Y. Weiss
  • E. Sheshinski and Y. Weiss, editors, Optimal…
  • 1993
Highly Influential
4 Excerpts

On-Line Algorithms and Financial Decision Making

  • R. El-Yaniv
  • PhD thesis, Depart- ment of Computer Science,
  • 1994
1 Excerpt

Near-Optimal Bin Packing Algorithms

  • D. S. Johnson
  • PhD thesis, Massachusetts Insti- tute of…
  • 1973
1 Excerpt

Bounds for certain multiprocessing anomalies

  • R. L. Graham
  • SIAM Journal on Com- puting, 17:263{269
  • 1969
1 Excerpt

Foundations of Optimization

  • D. J Wilde, C. S. Beighther
  • Prentice{Hall, Inc., En- glewood Cli s, N.J.
  • 1967
1 Excerpt

Similar Papers

Loading similar papers…