Pages that link to "Item:Q1363372"
From MaRDI portal
The following pages link to The maximal generic number of pure Nash equilibria (Q1363372):
Displaying 11 items.
- Circulant games (Q256774) (← links)
- Random extensive form games (Q337830) (← links)
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games (Q816528) (← links)
- Generic \(4\times 4\) two person games have at most 15 Nash equilibria (Q1279618) (← links)
- On the testable implications of collective choice theories (Q1587639) (← links)
- A sandwich theorem for generic \(n \times n\) two person games (Q2178007) (← links)
- Golden games (Q2235746) (← links)
- Unmixing the mixed volume computation (Q2421592) (← links)
- Uniqueness of stationary equilibrium payoffs in coalitional bargaining (Q2434224) (← links)
- Asymptotic expected number of Nash equilibria of two-player normal form games (Q2485483) (← links)
- Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise (Q6109850) (← links)