144 search results - page 9 / 29 » Computing Nash Equilibria of Action-Graph Games |
134
Voted
ECCC
2006
15 years 1 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
144
click to vote
JAIR
2011
14 years 4 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
110
click to vote
WINE
2007
Springer
15 years 8 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
138
click to vote
JSAC
2008
15 years 1 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
111
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...