Third edition of Artificial Intelligence: foundations of computational agents, Cambridge University Press, 2023 is now available (including the full text).
10.4.1 Computing Nash Equilibria
To compute a Nash equilibrium for a game in strategic form, there are three steps:
- Eliminate dominated strategies.
- Determine which actions will have non-zero probabilities; this is called the support set.
- Determine the probability for the actions in the support set.
It turns out that the second of these is the most difficult.
