Totally Unimodular Congestion Games

We investigate a new class of congestion games, called Totally Unimodular Congestion Games, in which the strategies of each player are expressed as binary vectors lying in a polyhedron defined using a totally unimodular constraint matrix and an integer right-hand side. We study both the symmetric and the asymmetric variants of the game. In the symmetric variant, all players have the same strategy set, i.e. the same constraint matrix and right-hand side. Network congestion games are an example of this class. Fabrikant et al. proved that a pure Nash equilibrium of symmetric network congestion games can be found in strongly polynomial time, while the asymmetric network congestion games are PLS-complete. We give a strongly polynomial-time algorithm to find a pure Nash equilibrium of any symmetric totally unimodular congestion game. We also identify four totally unimodular congestion games, where the players' strategy sets are matchings, vertex covers, edge covers and stable sets of a given bipartite graph. For these games we derive specialized combinatorial algorithms to find a pure Nash equilibrium in the symmetric variant, and show the asymmetric variant is PLS-complete.


University of Wisconsin-Madison, November 2015



View Totally Unimodular Congestion Games