Maintaining Random Assignments under Adversarial Dynamics
This work addresses challenges in dynamic algorithms for adversarial settings, with incremental improvements to existing proactive resampling techniques.
The paper tackles the problem of maintaining random assignments under adversarial dynamic changes, proposing new resampling schemes based on a 'temporal aggregation' principle to counteract biases from adaptive adversaries, achieving applications such as maintaining O(Δ) coloring for general graphs with sublinear average work per modification.
We study and further develop powerful general-purpose schemes to maintain random assignments under adversarial dynamic changes. The goal is to maintain assignments that are (approximately) distributed similarly as a completely fresh resampling of all assignments after each change, while doing only a few resamples per change. This becomes particularly interesting and challenging when dynamics are controlled by an adaptive adversary. Our work builds on and further develops the proactive resampling technique [Bhattacharya, Saranurak, and Sukprasert ESA'22]. We identify a new ``temporal selection'' attack that adaptive adversaries can use to cause biases, even against proactive resampling. We propose a new ''temporal aggregation'' principle that algorithms should follow to counteract these biases, and present two powerful new resampling schemes based on this principle. We give various applications of our new methods. The main one in maintaining proper coloring of the graph under adaptive adversarial modifications: we maintain $O(Î)$ coloring for general graphs with maximum degree $Î$ and $O(\fracÎ{\ln Î})$ coloring for triangle free graphs, both with sublinear in the number of vertices average work per modification. Other applications include efficiently maintaining random walks in dynamically changing graphs.