Generic \(4\times 4\) two person games have at most 15 Nash equilibria
type: Item
instance of: scholarly article
title: Generic \(4\times 4\) two person games have at most 15 Nash equilibria
zbMATH Open document ID: 0930.91003
author: In-Uck Park
author: Andrew McLennan
published in: Games and Economic Behavior
publication date: 2000-02-09T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 1250632
zbMATH Keywords: maximal generic number of Nash equilibria
MaRDI profile type: Publication
full work available at URL: game.1998.0640
OpenAlex ID: W2009035217
cites work: Probability of a pure equilibrium point in n-person games
cites work: A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
cites work: An enumeration of simplicial 4-polytopes with 8 vertices
cites work: Oddness of the number of equilibrium points: a new proof
cites work: On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game
cites work: The maximal number of regular totally mixed Nash equilibria
cites work: The maximal generic number of pure Nash equilibria
cites work: Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
cites work: A theorem on the number of Nash equilibria in a bimatrix game
cites work: Q4143064
cites work: The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games
cites work: A note on the probability of \(k\) pure Nash equilibria in matrix games
cites work: Lectures on Polytopes
DOI: 10.1006/GAME.1998.0640
description: scientific article; zbMATH DE number 1250632