Sciweavers

5 search results - page 1 / 1
» Computing Equilibria in Bimatrix Games by Parallel Vertex En...
Sort
View
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
ISPDC
2008
IEEE
13 years 11 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
ICTAI
2006
IEEE
13 years 11 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...
CSE
2009
IEEE
13 years 11 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—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...
Jonathan Widger, Daniel Grosu
ICDCS
2010
IEEE
13 years 8 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...