Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network congestion game with player-specific costs. In the first presentation, different players may contribute differently to congestion, and in the second, they are differently (negatively)...

Polyequilibrium is a generalization of Nash equilibrium that is applicable to any strategic game, whether finite or otherwise, and to dynamic games, with perfect or imperfect information. It differs from equilibrium in specifying strategies that players do not choose and by requiring an...

Static stability in strategic games differs from dynamic stability in only considering the players' incentives to change their strategies. It does not rely on any assumptions about the players' reactions to these incentives and it is thus not linked with any particular dynamics. This paper...