Sciweavers

19 search results - page 1 / 4
» Nash equilibria of a generic networking game with applicatio...
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
Nash equilibria of a generic networking game with applications to circuit-switched networks
— A generic mechanism for end-user transmission rate control into a differentiated services Internet is formulated and basic results of corresponding Nash equilibria are proved. ...
Youngmi Jin, George Kesidis
ESA
2010
Springer
236views Algorithms» more  ESA 2010»
13 years 5 months ago
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
Tobias Harks, Martin Hoefer, Max Klimm, Alexander ...
ICALP
2011
Springer
12 years 8 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Nash equilibria in graphical games on trees revisited
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...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
13 years 10 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
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...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...