Network Topology and Equilibrium Existence in Weighted Network Congestion Game

Igal Milchtaich, Bar-Ilan University

Abstract. Every finite game can be represented as a weighted network congestion game on some undirected two-terminal network. The network topology may reflect certain properties of the game. This paper solves the topological equilibrium-existence problem of identifying all networks on which every weighted network congestion games has a pure-strategy equilibrium.

JEL Code: C72

Keywords: Network games; Congestion games; Existence of pure-strategy equilibrium; Finite improvement property