294 search results - page 27 / 59 » The complexity of computing a Nash equilibrium |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
103
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
MOBIHOC
2004
ACM
15 years 3 months ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, we study the interaction between overlay routing and Traffic Engineering (TE) in a single Autonomous System (AS). We formulate this interaction as a twoplayer n...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...