144 search results - page 19 / 29 » Computing Nash Equilibria of Action-Graph Games |
SIGECOM
2005
ACM
14 years 29 days ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
WAOA
2005
Springer
14 years 27 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...
AAAI
2006
13 years 8 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...