Article ID: | iaor20081456 |
Country: | United States |
Volume: | 55 |
Issue: | 2 |
Start Page Number: | 215 |
End Page Number: | 225 |
Publication Date: | Mar 2007 |
Journal: | Operations Research |
Authors: | Schulz Andreas S., Correa Jos R., Stier-Moses Nicols E. |
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