Sciweavers

156 search results - page 1 / 32
» Homotopy Methods to Compute Equilibria in Game Theory
Sort
View
DAGSTUHL
2007
13 years 6 months ago
Homotopy Methods to Compute Equilibria in Game Theory
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
P. Jean-Jacques Herings, Ronald Peeters
ICPP
2009
IEEE
13 years 11 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu
SAGT
2009
Springer
338views Game Theory» more  SAGT 2009»
13 years 11 months ago
Computational Aspects of Equilibria
Mihalis Yannakakis
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 3 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
MP
2006
110views more  MP 2006»
13 years 4 months ago
Robust game theory
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Michele Aghassi, Dimitris Bertsimas