2-Player: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:2111:21, 15 February 2023‎ Admin talk contribs‎ 733 bytes +733‎ Created page with "{{DISPLAYTITLE:2-Player (Nash Equilibria)}} == 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/2-Player"