Randomized distributed online algorithms against adaptive offline adversaries

In the sequential setting, a decades-old fundamental result in online algorithms states that if there is a c-competitive randomized online algorithm against an adaptive, offline adversary, then there is a c-competitive deterministic algorithm. The adaptive, offline adversary is the strongest adversa...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 161; p. 105973
Main Authors:	Boyar, Joan, Ellen, Faith, Larsen, Kim S.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2020
Subjects:	Adaptive offline adversary Distributed systems Online algorithms Randomized algorithms Online algorithms Randomized algorithms Distributed systems Adaptive offline adversary
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!