Sciweavers

MST
2010
78views more  MST 2010»
13 years 2 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
MST
2010
98views more  MST 2010»
13 years 2 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
IOR
2007
89views more  IOR 2007»
13 years 3 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
SIGECOM
2008
ACM
143views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Altruism, selfishness, and spite in traffic routing
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
Po-An Chen, David Kempe
FOCS
2000
IEEE
13 years 7 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
CAAN
2007
Springer
13 years 7 months ago
Nonadaptive Selfish Routing with Online Demands
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...
Tobias Harks, László A. Végh
PODC
2005
ACM
13 years 9 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
13 years 9 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 3 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
14 years 3 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias