108 search results - page 12 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
JSAC
2007
14 years 11 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...
77
Voted
CORR
2010
Springer
14 years 11 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...
96
Voted
BIRTHDAY
2009
Springer
15 years 6 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...
134
click to vote
SIGECOM
2011
ACM
14 years 2 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...
76
Voted
SAGT
2009
Springer
15 years 6 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 ...