Difference: ComputingNormalFormErrata (14 vs. 15)

Revision 152020-05-28 - LeiZhou

Line: 1 to 1

Chapter 4: Computing Solution Concepts of Normal-Form Games

  • Page number: 100 (electronic version, Revision 1.1)
    • Section number: 4.2.2
    • Date: May 28, 2020
    • Name: Lei Zhou
    • Email: leizhou[at]pku[dot]edu[dot]cn
    • Content: In "Each such equation has the form v=c+qu+T, where v is the clashing variable, c is a constant (initially they are all 1), u is the entering variable, q is a constant coefficient, and T is a linear combination of variables other than v or u. The clashing variable to leave is the one in whose equation the q/c ratio is smallest", the ratio should be c/|q| (used in the examples followed). In "At this point the algorithm terminates since, between them, Equations (4.25) and (4.24) contain all the labels”, I think the algorithm terminates because all the labels are contained in the basis. In "Renormalizing the vectors x′ and y′ to be proper probabilities, one gets the solution ((2/3,1/3, 0), (1/3,2/3)) ...", the solution is got by first setting all the variables in the right-hand side of Equations (4.25) and (4.24) to be zero and then renormalizing the vectors x' and y'.
  • Page number: 95 (first edition)
    • Section number: 4.2.2
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2021 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback