On Random Symmetric Bimatrix Games

DOI10.1142/S0219198920500024zbMath1479.91067OpenAlexW2991607875MaRDI QIDQ5012901

Ferenc Forgó, Jozsef Abaffy

Publication date: 26 November 2021

Published in: International Game Theory Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219198920500024

zbMATH Keywords

complexityexperimental gamesbimatrix gamerandom games

Mathematics Subject Classification ID

2-person games (91A05) Probabilistic games; gambling (91A60) Experimental studies (91A90)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of Nash equilibria for two-player games
• On the support size of stable strategies in random games
• On the complexity of the parity argument and other inefficient proofs of existence
• Random bimatrix games are asymptotically easy to solve (a simple proof)
• A note on the probability of \(k\) pure Nash equilibria in matrix games
• Limiting distributions of the number of pure strategy Nash equilibria in \(n\)-person games
• Asymptotic expected number of Nash equilibria of two-player normal form games
• Nash equilibria of Cauchy-random zero-sum and coordination matrix games
• The Probability of a Saddlepoint
• COMPUTATION OF COMPLETELY MIXED EQUILIBRIUM PAYOFFS IN BIMATRIX GAMES
• A symmetrization for finite two-person games
• The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games
• Constant rank bimatrix games are PPAD-hard
• Equilibrium Points of Bimatrix Games
• The Expected Number of Nash Equilibria of a Normal Form Game
• Nash equilibria in random games
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• Equilibrium points in n -person games