Sciweavers

1087 search results - page 8 / 218
» Dynamics in congestion games
Sort
View
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 7 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
ICDE
2005
IEEE
109views Database» more  ICDE 2005»
14 years 2 months ago
TCP Congestion Window Controlling Algorithms on iSCSI Sequential Read Access
iSCSI is one of the most promising technologies in IPSAN, which decreases a storage management cost. Congestion Window, one of TCP parameters, has a close relationship with system...
Machiko Toyoda, Masato Oguchi, Saneyasu Yamaguchi
SAGT
2010
Springer
151views Game Theory» more  SAGT 2010»
13 years 7 months ago
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...
INFOCOM
2010
IEEE
13 years 7 months ago
Wireless Network Virtualization as A Sequential Auction Game
—We propose a virtualization framework to separate the network operator (NO) who focuses on wireless resource management and service providers (SP) who target distinct objectives...
Fangwen Fu, Ulas C. Kozat
ATAL
2009
Springer
14 years 3 months ago
Learning equilibria in repeated congestion games
While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attenti...
Moshe Tennenholtz, Aviv Zohar