The maximal generic number of pure Nash equilibria
From MaRDI portal
(Redirected from Publication:1363372)
Recommendations
- The maximal number of regular totally mixed Nash equilibria
- On the number of pure strategy Nash equilibria in finite common payoffs games
- The number of pure Nash equilibria in a random game with nondecreasing best responses
- On the number of pure strategy Nash equilibria in random games
- On the maximal number of Nash equilibria in an n n bimatrix game
- Mathematical Foundations of Computer Science 2005
- The maximum theorem and the existence of Nash equilibrium of (generalized) games without lower semicontinuities
- Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
- The complexity of pure Nash equilibria
- Pure Nash equilibria in finite two-person non-zero-sum games
Cites work
Cited in
(12)- Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise
- Golden games
- Asymptotic expected number of Nash equilibria of two-player normal form games
- A sandwich theorem for generic \(n \times n\) two person games
- Generic \(4\times 4\) two person games have at most 15 Nash equilibria
- Circulant games
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Uniqueness of stationary equilibrium payoffs in coalitional bargaining
- Unmixing the mixed volume computation
- Random extensive form games
- On the testable implications of collective choice theories
- The number of pure Nash equilibria in a random game with nondecreasing best responses
This page was built for publication: The maximal generic number of pure Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363372)
