Fast, Fair, and Efficient Flows in Networks

9 years 7 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 are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in this situation: all flow-carrying paths have the same length; i.e., these solutions are “fair,” which is in general not true for optimal flows in networks with nonlinear latency functions. In addition, the maximum latency of the Nash equilibrium, which can be computed efficiently, is within a constant factor of that of an optimal solution. That is, the so-called price of anarchy is bounded. In contrast, we present a family of instances with multiple sources and a single sink for which the price of anarchy is unbounded, even in networks with linear latencies. Furthermore, we show that an s-t-flow that is optimal with respect to the average latency objective is near optimal for t...
José R. Correa, Andreas S. Schulz, Nicol&aa
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IOR
Authors José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
Comments (0)