108 search results - page 5 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
WAOA
2005
Springer
14 years 24 days ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
MOBIHOC
2012
ACM
11 years 9 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
IPL
2010
13 years 4 months ago
2010
We introduce a game-theoretic model of diffusion of technologies, advertisements, or influence through a social network. The novelty in our model is that the players are intereste...
SODA
2010
ACM
13 years 5 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
14 years 1 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...