103 search results - page 6 / 21 » Hedonic clustering games |
ISPDC
2008
IEEE
15 years 3 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...
102
click to vote
AMDO
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. The growth of computational power of contemporary hardware causes technologies working with 3D-data to expand. Examples of the use of this kind of data can be found in ge...
UAI
2008
14 years 10 months ago
2008
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
CCGRID
2003
IEEE
15 years 2 months ago
2003
IEEE
CSE
2009
IEEE
15 years 4 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...