108 search results - page 12 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
JSAC
2007
13 years 7 months ago
2007
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. H...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
SAGT
2009
Springer
14 years 1 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...