Sciweavers

117 search results - page 17 / 24
» Altruism in Congestion Games
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
GLOBECOM
2009
IEEE
14 years 4 months ago
PEMP: Peering Equilibrium MultiPath Routing
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
Stefano Secci, Jean-Louis Rougier, Achille Pattavi...
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 4 months ago
Stability Analysis of Transportation Networks with Multiscale Driver Decisions
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers’ route choices are influenced by information at multiple temporal and spat...
Giacomo Como, Ketan Savla, Daron Acemoglu, Munther...
INFOCOM
2010
IEEE
13 years 8 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
WINE
2010
Springer
251views Economy» more  WINE 2010»
13 years 7 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis