Fast, Fair, and Efficient Flows in Networks

  • Authors:

  • José R. Correa;Andreas S. Schulz;Nicolás E. Stier-Moses

  • Affiliations:

  • School of Business, Universidad Adolfo Ibáòez, Av. Presidente Errázuriz 3485, Las Condes, Santiago, Chile;Sloan School of Management, Massachusetts Institute of Technology, E53-361, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139;Graduate School of Business, Columbia University, Uris Hall, Room 418, 3022 Broadway, New York, New York 10027

  • Venue:
  • Operations Research
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 the maximum latency objective, and it is close to being fair. Conversely, the average latency of a flow minimizing the maximum latency is also within a constant factor of that of a flow minimizing the average latency.