A class of games possessing pure-strategy Nash equilibria

  title={A class of games possessing pure-strategy Nash equilibria},
  author={Robert W. Rosenthal},
  journal={International Journal of Game Theory},
  • R. Rosenthal
  • Published 1 December 1973
  • Mathematics
  • International Journal of Game Theory
A class of noncooperative games (of interest in certain applications) is described. Each game in the class is shown to possess at least one Nash equilibrium in pure strategies. 
On the existence of a pure strategy Nash equilibrium in group formation games
Abstract This paper provides sufficient conditions for the existence of pure strategy Nash equilibrium in a class of games of group formation. The use of potentials allows for a characterization ofExpand
Pure Nash equilibria
We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-ha...
Determinateness of Strategic Games with a Potential
Finite potential games are determined, i.e. have Nash-equilibria in pure strategies.In this paper we investigate the determinateness of potential games, in which one or more players have infinitelyExpand
Rare Nash Equilibria and the Price of Anarchy in Large Static Games
This work studies a static game played by a finite number of agents, in which agents are assigned independent and identically distributed random types and each agent minimizes its objective function by exploiting the randomness of the randomly distributed types. Expand
Congestion Games with Player-Specific Payoff Functions
A class of noncooperative games in which the players share a common set of strategies is described. The payoff a player receives for playing a particular strategy depends only on the total number ofExpand
Bounding the inefficiency of Nash equilibria in games with finitely many players
  • U. Rothblum
  • Mathematics, Computer Science
  • Oper. Res. Lett.
  • 2007
Borders are derived on the gap between optimal performance and the performance of Nash equilibria in n-person games with continuous action sets in congestion games. Expand
Greediness and Equilibrium in Congestion Games
We study the class of congestion games for which the set of Nash equilibrium is equivalent to the set of strategy profiles played by greedy myopic players. We show these two coincide iff such gamesExpand
Congestion Games with Player-Specific Costs Revisited
This work provides a thorough characterization of the maximal sets of cost functions that guarantee the existence of a pure Nash equilibrium in congestion games with player-specific costs. Expand
Refinements of Nash equilibrium in potential games
We prove the existence of a pure-strategy trembling-hand perfect equilibrium in upper semicontinuous potential games, and we show that generic potential games possess pure-strategy strictly perfectExpand
Potential Functions in Strategic Games
We investigate here several categories of strategic games and antagonistic situations that are known to admit potential functions, and are thus guaranteed to either possess pure Nash equilibria or toExpand


The network equilibrium problem in integers
It is shown that pure-strategy Nash equilibria exist and that any solution to an integer-variable analogue of the usual network equilibrium model is such a Nash equilibrium. Expand
Management Models and Industrial Applications of Linear Programming
In place of a survey or evaluation of industrial studies, two broad issues which are relevant to all such applications will be discussed, including the use of linear programming models as guides to data collection and analysis and prognosis of fruitful areas of additional research, especially those which appear to have been opened by industrial applications. Expand