Equilibrium Tracing in Bimatrix Games

Balthasar, Anne

doi:10.4230/DagSemProc.07471.2

Document

Equilibrium Tracing in Bimatrix Games

Author Anne Balthasar

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 7471
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2008-06-04

PDF

File

PDF

DagSemProc.07471.2.pdf

Filesize: 222 kB
14 pages

Document Identifiers

DOI: 10.4230/DagSemProc.07471.2
URN: urn:nbn:de:0030-drops-15265

Subject Classification

Keywords

Bimatrix games
Equilibrium computation
Homotopy methods
Index

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get BibTex

Anne Balthasar. Equilibrium Tracing in Bimatrix Games. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 7471, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/DagSemProc.07471.2

Author Details

Anne Balthasar

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail