The lazy adversary conjecture fails

Authors:
Enoch Peserico
Affiliations:
Massachusetts Institute of Technology
Venue:
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2002

Citing 4
Cited 0

Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Random walks on weighted graphs and applications to on-line algorithms

Journal of the ACM (JACM)
Online computation and competitive analysis

Online computation and competitive analysis
The combinatorics of effective resistances and resistive inverses

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that, in general, the lazy adversary conjecture fails. Moreover, it fails in a very strong sense: an adversary which is even "slightly lazy" can perform arbitrarily worse than one which is not.