Chapter 4: Computing Solution Concepts of Normal-Form Games
Page number:
Section number:
Date:
Name:
Email:
Content:
Page number:
Section number:
Date:
Name:
Email:
Content:
The following errors are fixed in the second printing of the book and online PDF v1.1
Page number: 92 (electronic version)
Date: May 28 2009
Name:Kevin
Section: 4.2.1
Content:After "We can now state the main complexity result.", add a footnote: "This theorem describes the problem of approximating a Nash equilibrium to an arbitrary, specified degree of precision (i.e., computing an $\epsilon$-equilibrium for a given $\epsilon$). The equilibrium computation problem is defined in this way partly because games with three or more players can have equilibria involving irrational-valued probabilites."