108 search results - page 14 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
104
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
JSAC
2007
14 years 9 months ago
2007
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
94
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
68
Voted
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—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...