170 search results - page 1 / 34 » Parallel Computation of Nash Equilibria in N-Player Games |
ISPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
ICPP
2009
IEEE
13 years 11 months ago
2009
IEEE
—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...
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
FORMATS
2010
Springer
13 years 2 months ago
2010
Springer
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...