toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Record Links
Author (up) Colini-Baldeschi, R.; Cominetti, R.; Scarsini, M. doi  openurl
  Title Price of Anarchy for Highly Congested Routing Games in Parallel Networks Type Journal Article
  Year 2018 Publication Theory of Computing Systems Abbreviated Journal  
  Volume to appear Issue Pages  
  Keywords  
  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.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1432-4350 ISBN Medium  
  Area Expedition Conference  
  Notes Approved no  
  Call Number UAI @ eduardo.moreno @ Serial 774  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: