5 search results - page 1 / 1 » Nash Equilibria in Discrete Routing Games with Convex Latenc... |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
CAAN
2007
Springer
13 years 9 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...