Chapter 4: Computing Solution Concepts of Normal-Form Games
Page number: 97 (first edition)
Section number: 4.2.2
Date: January 6 2014
Content: In "... the one in whose equation the q/c ratio is smallest", the ratio should be c/q (at least that is what is used in the example that follows in the text).
Page number: 114 (electronic version)
Section number: 4.6 (Theorem 4.6.1)
Name: Haden Lee
Content: The theorem states that "The following problems are [...] guaranteed payoff, subset inclusion, and subset containment." However, I don't think that "subset inclusion" and "subset containment" were mentioned in the section previously. Comparing this to Theorem 4.2.3, I wonder if these were meant to be "action inclusion" and "action exclusion" instead.
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
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."