# Difference: RicherRepresentationsErrata (5 vs. 6)

Line: 1 to 1

 META TOPICPARENT name="Errata"

## Chapter 6: Richer Representations: Beyond the Normal and Extensive Forms

• Page number: 162
Line: 13 to 13

• Name:Eugene Vorobeychik
• Email:eug.vorobey@gmail.com
• Content:The first paragraph implies that general-sum single-controller stochastic games can be solved in polynomial time. A special case of such games are general-sum finite-action games, for which no poly-time procedure exists. I believe what is meant are zero-sum single-controller games (I believe Filar and Vrieze (1997) offer a linear programming formulation for this case).
>
>
• Page number: 174
• Section number:6.4.1
• Date:04/19/2014
• Content:Definition 6.4.1. "R is a set of r resources" -> "R is a set of k resources". This is a minor point, but throughout sections 6.4.1-6.4.4, "r" is being used for referring to a certain resource in R. Also in comparison, Definition 6.4.7 (for nonatomic version) states "R is a set of k resources".
Similarly, "c = (c_1, \dots, c_r) where c_k ... is a cost function for resource k \in R" should be changed to "c = (c_1, \dots, c_k) where c_r is a cost function for resource r \in R" (also see Definition 6.4.7 for comparison).

• Page number: 175
• Section number:6.4.2
• Date:04/04/2014
• Content:"However, if we run MyopicBestResponse with a = (L, U) ..." => (U, L) just to be consistent with the convention of this book that specifies the row player's action first.
>
>
• Page number: 177
• Section number:6.4.3
• Date:04/19/2014
• Content: Proof of Theorem 6.4.6 (Every congestion game is a potential game.).
In the equations of the proof, "c_r(j + 1)" should be changed to "c_r(#(r, a_{-i}) + 1)" (this occurs twice). Notice that j appears in the summation and runs from 1 to #(r, (a_{-i})).
• Page number: 177
• Section number:6.4.3
• Date:04/19/2014