## Abstract

A classic optimization problem in network routing is to minimize C+D, where C is the maximum edge congestion and D is the maximum path length (also known as dilation). The problem of computing the optimal C*+D* is NP-complete even when either C* or D* is a small constant. We study routing games in general networks where each player i selfishly selects a path that minimizes C _{i} + Dthe sum of congestion and dilation of the player's path. We first show that there are instances of this game without Nash equilibria. We then turn to the related quality of routing (QoR) games which always have Nash equilibria. QoR games represent networks with a small number of service classes where paths in different classes do not interfere with each other (with frequency or time division multiplexing). QoR games have O(log ^{4} n) price of anarchy when either C* or D* is a constant. Thus, Nash equilibria of QoR games give poly-log approximations to hard optimization problems.

Original language | English (US) |
---|---|

Article number | 5963649 |

Pages (from-to) | 1270-1283 |

Number of pages | 14 |

Journal | IEEE Transactions on Computers |

Volume | 61 |

Issue number | 9 |

DOIs | |

State | Published - 2012 |

Externally published | Yes |

## Keywords

- Algorithmic game theory
- Nash equilibrium
- congestion game
- price of anarchy
- routing game

## ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics