179 search results - page 9 / 36 » On Learning Algorithms for Nash Equilibria |
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
UAI
2001
14 years 11 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
102
click to vote
TCS
2010
14 years 4 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...