Limiting distributions of the number of pure strategy Nash equilibria in n-person games
The author studies the number of pure Nash equilibria in a ``random \(n\)-person game. This game is defined as the classical noncooperative \(n\)-person game, in which a player \(k\), \(1\leq k\leq n\), has \(m_ k\) pure strategies, and his preferences over all of the \(M=\Pi m_ k\) possible outcomes is randomly chosen with the help of a random drawing of \(M\) numbers from \(1,2,\dots,M\). Here, according to standard convention, the higher the number associated with an outcome, the more the player prefers it. Additionally, it is assumed that the players choose their preferences independently of each other. The author investigates two cases of the model related to the random drawing with and without replacement. It is shown for both cases that the distribution of the number of pure Nash equilibrium in such games approaches the Poisson distribution with mean 1 as \(m_ k\to +\infty\) for at least two \(k\)'s.
- A note on the probability of k pure Nash equilibria in matrix games
- On the number of pure strategy Nash equilibria in random games
- The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games
- The number of pure Nash equilibria in a random game with nondecreasing best responses
- On the number of pure strategy Nash equilibria in finite common payoffs games
- On the distribution of pure strategy equilibria in finite games with vector payoffs
- On the number of pure strategy Nash equilibria in finite common payoffs games
- Generic \(4\times 4\) two person games have at most 15 Nash equilibria
- The maximal generic number of pure Nash equilibria
- On the number of pure strategy Nash equilibria in random games
- Individually rational pure strategies in large games
- A note on the probability of k pure Nash equilibria in matrix games
- The frequency of convergent games under best-response dynamics
- Golden games
- Asymptotic expected number of Nash equilibria of two-player normal form games
- Nash equilibria of Cauchy-random zero-sum and coordination matrix games
- When ``better is better than ``best
- Random extensive form games
- Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games
- The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games
- On random symmetric bimatrix games
- Pure Nash equilibria and best-response dynamics in random games
- The Expected Number of Nash Equilibria of a Normal Form Game
- Connectivity and equilibrium in random games
- On the probability of existence of pure equilibria in matrix games
- On the probability of existence of pure equilibria in matrix games
- Best-response dynamics, playing sequences, and convergence to equilibrium in random games
- The complexity of game isomorphism
- Best-response dynamics in two-person random games with correlated payoffs
- Exact asymptotics and continuous approximations for the lowest unique positive integer game
- The number of pure strategy Nash equilibria in random multi-team games
- The number of pure Nash equilibria in a random game with nondecreasing best responses
- Probabilities of pure Nash equilibria in matrix games when the payoff entries of one player are randomly selected
- Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players
This page was built for publication: Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277378)
