Price of anarchy for highly congested routing games in parallel networks
type: Item
instance of: scholarly article
title: Price of anarchy for highly congested routing games in parallel networks
zbMATH Open document ID: 1411.91136
author: Riccardo Colini-Baldeschi
author: Roberto Cominetti
author: Marco Scarsini
published in: Theory of Computing Systems
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A07
zbMATH DE Number: 7040093
zbMATH Keywords: nonatomic routing games
zbMATH Keywords: price of anarchy
zbMATH Keywords: regularly varying functions
zbMATH Keywords: wardrop equilibrium
zbMATH Keywords: parallel networks
zbMATH Keywords: high congestion
MaRDI profile type: Publication
full work available at URL: s00224-017-9834-1
OpenAlex ID: W2782168685
cites work: Q5186236
cites work: Q3992980
cites work: Selfish Routing in Capacitated Networks
cites work: Fast, Fair, and Efficient Flows in Networks
cites work: A geometric approach to the price of anarchy in nonatomic congestion games
cites work: Q5633348
cites work: Exact Price of Anarchy for Polynomial Congestion Games
cites work: Sensitivity of Wardrop equilibria
cites work: The price of anarchy in large games
cites work: Q3409969
cites work: On a theorem of Schmeidler
cites work: Generic uniqueness of equilibrium in large crowding games
cites work: Social optimality and cooperation in nonatomic congestion games.
cites work: Algorithms, games, and the internet
cites work: The price of anarchy is independent of the network topology
cites work: Q3524727
cites work: How bad is selfish routing?
cites work: Bounding the inefficiency of equilibria in nonatomic congestion games
cites work: Q3524726
cites work: Equilibrium points of nonatomic games
DOI: 10.1007/S00224-017-9834-1
Recommended article: On the Price of Anarchy of Highly Congested Nonatomic Network Games
Recommended article: Strong and Pareto Price of Anarchy in Congestion Games
Recommended article: Computation of equilibria and the price of anarchy in bottleneck congestion games
Recommended article: Bottleneck Congestion Games with Logarithmic Price of Anarchy
Recommended article: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Recommended article: Congestion games with linearly independent paths: convergence time and price of anarchy
Recommended article: The price of anarchy of affine congestion games with similar strategies
Recommended article: Q5420270
Recommended article: Q2943337
Recommended article: The strong price of anarchy of linear bottleneck congestion games
description: scientific article; zbMATH DE number 7040093