Statistical mechanics of random two-player games

Abstract

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate quantities such as the number of equilibrium points, the expected payoff, and the fraction of strategies played with non-zero probability as a function of the correlation between the payoff matrices of both players and compare the results with numerical simulations.

16 pages, 6 figures, for further information see http://itp.nat.uni-magdeburg.de/~jberg/games.html

References in corpus (3)

• The Entropy of the K-Satisfiability Problem
• Matrix Games, Mixed Strategies, and Statistical Mechanics
• Entropy and typical properties of Nash equilibria in two-player games

Cited by in corpus (6)

• Statistical Mechanics of Competitive Resource Allocation using Agent-based Models
• Two-population replicator dynamics and number of Nash equilibria in random matrix games
• Statistical thermodynamics for choice models on graphs
• Neural Networks, Game Theory and Time Series Generation
• Gradient dynamics in reinforcement learning
• Equation of state for agents on graphs