Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network … (undirected two-terminal) network provides information about the existence of pure-strategy Nash equilibrium in the game. For some … network has at most three routes that do traverse any edge in opposite directions, or it consists of several such networks …

This paper studies a non-cooperative model of network formation. Built upon the two-way flow model of Bala and Goyal …

Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network … (undirected two-terminal) network provides information about the existence of pure-strategy Nash equilibrium in the game. For some … network has at most three routes that do traverse any edge in opposite directions, or it consists of several such networks …