179 search results - page 17 / 36 » On Learning Algorithms for Nash Equilibria |
132
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
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 ...
123
click to vote
SAGT
2010
Springer
15 years 7 days ago
2010
Springer
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
144
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
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...