Distributed Computing

We consider the problem of computing approximate Nash equilibria in monotone congestion games (a class of games generalizing network congestion games) with polynomially decreasing cost functions. In particular, we consider the case in which each ...${}_{}$${}_{}{}^{}$$\mathrm{}$$\mathrm{}$$$$$${}^{}$$\mathrm{}$$\mathrm{}$

We give a distributed algorithm in the CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (Proceedings of the 30th International Symposium on Distributed ...$$$$$$$$$\mathrm{}\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}$

Communication cost is the most commonly used metric in assessing the efficiency of operations in distributed algorithms for message-passing environments. In doing so, the standing assumption is that the cost of local computation is negligible ...

The problems of Byzantine Broadcast (BB) and Byzantine Agreement (BA) are of interest to both the distributed computing and cryptography communities. Extension protocols for these primitives have been introduced to handle long messages efficiently ...$$$\mathrm{}$$\mathrm{}$$\mathcal{}$$$$\mathcal{}$$$$\mathcal{}\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$

Distributed optimization algorithms are frequently faced with solving sub-problems on disjoint connected parts of a network. Unfortunately, the diameter of these parts can be significantly larger than the diameter of the underlying network, ...$\stackrel{}{\mathrm{}}\sqrt{}$${}^{\mathrm{}}$${}^{\mathrm{}}$