Price of Anarchy for Highly Congested Routing Games in Parallel Networks

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

We consider nonatomic routing games with one source and one destination connected by multiple parallel edges. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical observations, we prove that under suitable conditions on the costs the price of anarchy is asymptotic to one. We show with some counterexamples that this is not always the case, and that these counterexamples already occur in simple networks with only 2 parallel links.

Original languageEnglish
Pages (from-to)90-113
Number of pages24
JournalTheory of Computing Systems
Volume63
Issue number1
DOIs
StatePublished - 15 Jan 2019

Keywords

  • High congestion
  • Nonatomic routing games
  • Parallel networks
  • Price of Anarchy
  • Regularly varying functions
  • Wardrop equilibrium

Fingerprint

Dive into the research topics of 'Price of Anarchy for Highly Congested Routing Games in Parallel Networks'. Together they form a unique fingerprint.

Cite this