questions about lecture 2
1. What is the meaning of s_i and r_j at the of page 1 and at the beginning of page 2?
2. How problems (2) and (2') (pages 2-3) are considered to be LP? In standard LP problems the value we are trying to minimize/maximize is the dot product of the variables vector with some constant vector.
3. Does the corollary that "It is possible to compute a NE in polynomial time for every Zero-Sum game" (cor' 8 page 4) refers to 2-players games only? or to any amount of players?