108 search results - page 4 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
INFOCOM
2003
IEEE
13 years 12 months ago
2003
IEEE
— 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. ...
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
FOCS
2007
IEEE
14 years 28 days ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
DIALM
2003
ACM
13 years 12 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
SIGECOM
2006
ACM
14 years 17 days 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...