Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 509224
- A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
- On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms
- Determinacy of equilibrium in outcome game forms
- On the generic finiteness of equilibrium outcome distributions in bimatrix game forms
Cited in
(14)- A global Newton method to compute Nash equilibria.
- Strong Nash equilibria and mixed strategies
- The algebraic geometry of perfect and sequential equilibrium: an extension
- Network formation and pairwise stability: a new oddness theorem
- On stable outcomes of approval, plurality, and negative plurality games
- Generic determinacy of Nash equilibrium in network-formation games
- The structure of Nash equilibria in Poisson games
- On the generic finiteness of equilibrium outcome distributions in bimatrix game forms
- scientific article; zbMATH DE number 509224 (Why is no real title available?)
- Structure theorems for game trees
- Essential equilibria
- Oddness of the number of Nash equilibria: the case of polynomial payoff functions
- Unknottedness of graphs of pairwise stable networks \& network dynamics
- Solid outcomes in finite games
This page was built for publication: Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531019)