eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2008-06-04
7471
1
15
10.4230/DagSemProc.07471.1
article
07471 Abstracts Collection – Equilibrium Computation
Herings, P. Jean-Jacques
Jurdzinski, Marcin
Bro Miltersen, Peter
Tardos, Eva
von Stengel, Bernhard
From 18 to 23 November 2007, the Dagstuhl Seminar 07471 ``Equilibrium Computation'' was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07471/DagSemProc.07471.1/DagSemProc.07471.1.pdf
Equilibrium
algorithm
polynomial time
game theory
economics
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2008-06-04
7471
1
14
10.4230/DagSemProc.07471.2
article
Equilibrium Tracing in Bimatrix Games
Balthasar, Anne
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07471/DagSemProc.07471.2/DagSemProc.07471.2.pdf
Bimatrix games
Equilibrium computation
Homotopy methods
Index
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2008-06-04
7471
1
40
10.4230/DagSemProc.07471.3
article
Homotopy Methods to Compute Equilibria in Game Theory
Herings, P. Jean-Jacques
Peeters, Ronald
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07471/DagSemProc.07471.3/DagSemProc.07471.3.pdf
Homotopy
Equilibrium computation
Non-cooperative games
Nash Equilibrium
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2008-06-04
7471
1
2
10.4230/DagSemProc.07471.4
article
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems
Halman, Nir
We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known for binary SSGs).
Using known reductions between various games, we achieve the first trongly subexponential solutions for Discounted and Mean Payoff Games. We also give alternative simple proofs for the best known upper bounds for Parity Games and binary SSGs.
To the best of our knowledge, the LP-type framework has been used so far only in order to yield linear or close to linear time algorithms for various problems in computational geometry and location theory. Our approach demonstrates the applicability of the LP-type framework in other fields, and for achieving subexponential algorithms.
This work has been published in Algorithmica, volume 49 (September 2007), pages 37-50
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07471/DagSemProc.07471.4/DagSemProc.07471.4.pdf
Subexponential algorithm
LP-type framework