Efficient Algorithms for Finding Nash Equilibria and Convergence in Networked Anti-Coordination Games

Networked anti-coordination games can be efficiently solved under the self non-essential mode, but are computationally intractable under the self essential mode. The best-response dynamics converges in polynomial time for both modes under the synchronous scheme, and for the self non-essential mode under the sequential scheme.