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 …

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 provides a game-theoretic model of network formation with a continuous effort choice. Efforts are strategic … complements for direct neighbors in the network and display global substitution/congestion effects. We show that if the parameter … links according to a network cost function. Again all socially optimal configurations are such that the network is a nested …