Nash Equilibria: 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 October 2022

    • curprev 11:5911:59, 10 October 2022‎ Admin talk contribs‎ 913 bytes +913‎ Created page with "== Problem 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. == Bounds Chart == 350px == Step Chart == File:Nash_EquilibriaStepChart.png|35..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Nash_Equilibria"