83 search results - page 5 / 17 » A Continuation Method for Nash Equilibria in Structured Game... |
ISAAC
2005
Springer
15 years 5 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...
111
click to vote
JSAC
2008
14 years 12 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...
WINE
2007
Springer
15 years 6 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 ï¬...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a ï¬xed number of actions. We restrict ourselves to “compact†representati...
103
click to vote
ICML
1998
IEEE
16 years 20 days ago
1998
IEEE
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...