On the power of randomization in on-line algorithms

@article{BenDavid2005OnTP,
  title={On the power of randomization in on-line algorithms},
  author={S. Ben-David and A. Borodin and R. Karp and G. Tardos and A. Wigderson},
  journal={Algorithmica},
  year={2005},
  volume={11},
  pages={2-14}
}
  • S. Ben-David, A. Borodin, +2 authors A. Wigderson
  • Published 2005
  • Computer Science
  • Algorithmica
  • Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient “simulation” of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient deterministic algorithm, and show that this is possible in very general cases. 
    178 Citations

    Topics from this paper.

    DESIGN OF ON-LINE ALGORITHMS USING HITTING TIMES
    A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines
    • 2
    • PDF
    A Universal Randomized Packet Scheduling Algorithm
    • 7
    • PDF
    The weighted 2-server problem
    • 17
    Randomized algorithm for the k-server problem on decomposable spaces
    • 3
    Randomized competitive algorithms for online buffer management in the adaptive adversary model
    • 10
    • PDF
    Randomized Priority Algorithms: (Extended Abstract)
    • 3
    Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

    References

    SHOWING 1-10 OF 17 REFERENCES
    A strongly competitive randomized paging algorithm
    • 148
    Memory Versus Randomization in On-line Algorithms (Extended Abstract)
    • 64
    • Highly Influential
    • PDF
    Competitive Paging Algorithms
    • 436
    • PDF
    A competitive 3-server algorithm
    • 29
    Competitive k-Server Algorithms
    • 78
    • PDF
    The harmonic online K-server algorithm is competitive
    • 73
    New results on server problems
    • 258
    Competitive algorithms for on-line problems
    • 402
    The harmonic k-server algorithm is competitive
    • 58