In
computer science, an
online algorithm measures its
competitiveness against different
adversary models. For deterministic algorithms, the adversary is the same as the adaptive offline adversary. For randomized online algorithms competitiveness can depend upon the
adversary model used.