119 search results - page 14 / 24 » The complexity of pure Nash equilibria |
116
click to vote
MOBIHOC
2004
ACM
15 years 5 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...
SIGECOM
2008
ACM
14 years 11 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...
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...