Sciweavers

144 search results - page 3 / 29
» Computing Nash Equilibria of Action-Graph Games
Sort
View
ATAL
2007
Springer
14 years 12 days ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
ICPP
2009
IEEE
14 years 27 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
CDC
2009
IEEE
165views Control Systems» more  CDC 2009»
13 years 11 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
MOBIHOC
2012
ACM
11 years 8 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 6 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia