We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...