Sciweavers

3504 search results - page 3 / 701
» Computational Aspects of Equilibria
Sort
View
MOR
2010
106views more  MOR 2010»
13 years 4 months ago
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
Samid Hoda, Andrew Gilpin, Javier Peña, Tuo...
STOC
2004
ACM
84views Algorithms» more  STOC 2004»
14 years 5 months ago
Computing Nash equilibria for scheduling on restricted parallel links
Martin Gairing, Thomas Lücking, Marios Mavron...
CDC
2009
IEEE
165views Control Systems» more  CDC 2009»
13 years 10 months ago
Achieving symmetric Pareto Nash equilibria using biased replicator dynamics
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
Kiran Somasundaram, John S. Baras
ISPDC
2008
IEEE
13 years 12 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
Jonathan Widger, Daniel Grosu
ICPP
2009
IEEE
14 years 5 days 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