2026-08-05T19:41:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1525 2024-03-06T11:07:51Z ddc:004 open_access

Homotopy Methods to Compute Equilibria in Game Theory Herings, P. Jean-Jacques Peeters, Ronald Homotopy Equilibrium computation Non-cooperative games Nash Equilibrium This paper presents a survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present the relevant techniques underlying homotopy algorithms. We give detailed expositions of the Lemke-Howson algorithm and the van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and the Herings-van den Elzen, Herings-Peeters, and McKelvey-Palfrey algorithms to compute Nash equilibria in general $n$-person games. We explain how the main ideas can be extended to compute equilibria in extensive form and dynamic games, and how homotopies can be used to compute all Nash equilibria. Schloss Dagstuhl – Leibniz-Zentrum für Informatik P. Jean-Jacques Herings and Ronald Peeters 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07471.3 urn:nbn:de:0030-drops-15257 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07471.3 eng https://creativecommons.org/licenses/by/4.0/legalcode