Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem

Extended Abstract
  • José R. Correa
  • Andreas S. Schulz
  • Nicolás E. Stier Moses
Conference paper

DOI: 10.1007/978-3-540-25960-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3064)
Cite this paper as:
Correa J.R., Schulz A.S., Stier Moses N.E. (2004) Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem. In: Bienstock D., Nemhauser G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg

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, one can prove that 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 the optimal flow 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 that shows that the price of anarchy is unbounded for instances with multiple sources and a single sink, even in networks with linear latencies. Finally, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • José R. Correa
    • 1
  • Andreas S. Schulz
    • 1
  • Nicolás E. Stier Moses
    • 1
  1. 1.Operations Research CenterMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations