2008/01/01 by Anne Balthasar, Balthasar, Anne
Decision Sciences · Economics, Econometrics and Finance · Computer Science · #Game Theory and Applications #Game Theory and Voting Systems #Artificial Intelligence in Games
paper · doi:10.4230/dagsemproc.07471.2
We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known that the global Newton method encompasses the Lemke-Howson algorithm; we prove that it also comprises the van den Elzen-Talman algorithm, and more generally, the linear tracing procedure, as a special case. This will lead us to a discussion of traceability of equilibria of index +1. We answer negatively the open question of whether, generically, the van den Elzen-Talman algorithm is flexible enough to trace all equilibria of index +1.