A theorem on the number of Nash equilibria in a bimatrix game (Q1365001): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4732328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on the Proportion of Pure Strategy Equilibria in Generic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oddness of the number of equilibrium points: a new proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Stability of Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points in <i>n</i> -person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the number of Nash equilibria in a coordination game. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143064 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01263276 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4253228026 / rank
 
Normal rank

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
A theorem on the number of Nash equilibria in a bimatrix game
scientific article

    Statements

    Identifiers