Efficient Methods for Selfish Network Design

  • Authors:

  • Dimitris Fotakis;Alexis C. Kaporis;Paul G. Spirakis

  • Affiliations:

  • School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece 15780;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece 26500 and Research Academic Computer Technology Institute, Patras, Greece 26500;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece 26500 and Research Academic Computer Technology Institute, Patras, Greece 26500

  • Venue:
  • ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phenomenon in real-world networks. Any administrator, who wants to improve equilibrium delays in selfish networks, is facing some basic questions: (i) Is the network paradox-ridden ? (ii) How can we delete some edges to optimize equilibrium flow delays? (iii) How can we modify edge latencies to optimize equilibrium flow delays? Unfortunately, such questions lead to NP-hard problems in general. In this work, we impose some natural restrictions on our networks, e.g. we assume strictly increasing linear latencies. Our target is to formulate efficient algorithms for the three questions above. We manage to provide: A polynomial-time algorithm that decides if a network is paradox-ridden, when latencies are linear and strictly increasing. A reduction of the problem of deciding if a network with arbitrary linear latencies is paradox-ridden to the problem of generating all optimal basic feasible solutions of a Linear Program that describes the optimal traffic allocations to the edges with constant latency. An algorithm for finding a subnetwork that is almost optimal wrt equilibrium latency. Our algorithm is subexponential when the number of paths is polynomial and each path is of polylogarithmic length. A polynomial-time algorithm for the problem of finding the best subnetwork, which outperforms any known approximation algorithm for the case of strictly increasing linear latencies. A polynomial-time method that turns the optimal flow into a Nash flow by deleting the edges not used by the optimal flow, and performing minimal modifications to the latencies of the remaining ones. Our results provide a deeper understanding of the computational complexity of recognizing the Braess's paradox most severe manifestations, and our techniques show novel ways of using the probabilistic method and of exploiting convex separable quadratic programs.