toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Colini-Baldeschi, R.; Cominetti, R.; Scarsini, M. pdf  doi
openurl 
  Title Price of Anarchy for Highly Congested Routing Games in Parallel Networks Type
  Year 2019 Publication Theory Of Computing Systems Abbreviated Journal Theor. Comput. Syst.  
  Volume 63 Issue 1 Pages 90-113  
  Keywords Nonatomic routing games; Price of Anarchy; Regularly varying functions; Wardrop equilibrium; Parallel networks; High congestion  
  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 [Colini-Baldeschi, Riccardo; Scarsini, Marco] LUISS, Dipartimento Econ & Finanza, Viale Romania 32, I-00197 Rome, Italy, Email: rcolini@luiss.it;  
  Corporate Author Thesis  
  Publisher Springer Place of Publication Editor  
  Language English 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 WOS:000456320200005 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 974  
Permanent link to this record
 

 
Author Cominetti, R.; Scarsini, M.; Schroder, M.; Stier-Moses, N. doi  openurl
  Title Approximation and Convergence of Large Atomic Congestion Games Type
  Year 2022 Publication Mathematics of Operations Research Abbreviated Journal Math. Oper. Res.  
  Volume Early Access Issue Pages  
  Keywords unsplittable atomic congestion games; nonatomic congestion games; Wardrop equilibrium; Poisson games; symmetric equilibrium; price of anarchy; price of stability; total variation  
  Abstract We consider the question of whether and in what sense, Wardrop equilibria provide a good approximation for Nash equilibria in atomic unsplittable congestion games with a large number of small players. We examine two different definitions of small players. In the first setting, we consider games in which each player's weight is small. We prove that when the number of players goes to infinity and their weights to zero, the random flows in all (mixed) Nash equilibria for the finite games converge in distribution to the set of Wardrop equilibria of the corresponding nonatomic limit game. In the second setting, we consider an increasing number of players with a unit weight that participate in the game with a decreasingly small probability. In this case, the Nash equilibrium flows converge in total variation toward Poisson random variables whose expected values are War drop equilibria of a different nonatomic game with suitably defined costs. The latter can be viewed as symmetric equilibria in a Poisson game in the sense of Myerson, establishing a plausible connection between the Wardrop model for routing games and the stochastic fluctuations observed in real traffic. In both settings, we provide explicit approximation bounds, and we study the convergence of the price of anarchy. Beyond the case of congestion games, we prove a general result on the convergence of large games with random players toward Poisson games.  
  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 0364-765X ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000850694300001 Approved  
  Call Number UAI @ alexi.delcanto @ Serial 1647  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: