#5848. On the power of randomization in distributed algorithms in dynamic networks with adaptive adversaries

July 2026publication date
Proposal available till 17-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Theoretical Computer Science;
Computer Networks and Communications;
Hardware and Architecture;
Software;
Artificial Intelligence;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №5848.1 Contract №5848.2 Contract №5848.3 Contract №5848.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
This paper investigates the power of randomization in general distributed algorithms in dynamic networks where the networks topology may evolve over time, as determined by some adaptive adversary. In such a context, randomization may help algorithms to better deal with i) “bad” inputs to the algorithm, and ii) evolving topologies generated by “bad” adaptive adversaries. We prove that randomness offers limited power to better deal with “bad” adaptive adversary. We define a simple notion of prophetic adversary for determining the evolving topologies. Such an adversary accurately predicts all randomness in the algorithm beforehand, and hence the randomness will be useless against “bad” prophetic adversaries.
Keywords:
Adversary; Derandomization; Distributed algorithms; Dynamic networks

Contacts :
0