144 search results - page 19 / 29 » Computing Nash Equilibria of Action-Graph Games |
137
click to vote
SIGECOM
2005
ACM
15 years 7 months 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 ...
121
Voted
CORR
2010
Springer
15 years 2 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...
114
click to vote
WAOA
2005
Springer
15 years 7 months 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...
119
click to vote
AAAI
2006
15 years 3 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...
118
click to vote
CORR
2008
Springer
15 years 2 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...