2-Player (Nash Equilibria)
Jump to navigation
Jump to search
Description
In game theory, the Nash equilibrium, named after the mathematician John Forbes Nash Jr., is a proposed solution of a non-cooperative game involving two or more players in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy. As an algorithmic problem, given the payoff matrices for a bimatrix game, determine a Nash equilibrium.
Related Problems
Generalizations: n-player
Related: n-Player
Parameters
$m,n$: dimensions of payoff matrices
Table of Algorithms
Currently no algorithms in our database for the given problem.