Efficiency of atomic splittable selfish routing with polynomial cost functions
type: Item
instance of: scholarly article
title: Efficiency of atomic splittable selfish routing with polynomial cost functions
zbMATH Open document ID: 1162.90360
author: Hai Yang
author: Deren Han
author: Hong Kam Lo
published in: Networks and Spatial Economics
publication date: 2009-06-16T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 91B50
zbMATH DE Number: 5565189
zbMATH Keywords: price of anarchy
zbMATH Keywords: equilibrium
zbMATH Keywords: selfish routing
zbMATH Keywords: system optimum
zbMATH Keywords: network
MaRDI profile type: Publication
full work available at URL: s11067-007-9017-8
OpenAlex ID: W1989955802
Wikidata QID: Q59297175
cites work: Competitive routing in networks with polynomial costs
cites work: The Price of Routing Unsplittable Flow
cites work: The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
cites work: Selfish Routing in Capacitated Networks
cites work: On the Inefficiency of Equilibria in Congestion Games
cites work: Multiple Equilibrium Behaviors on Networks
cites work: On the relationship between Nash—Cournot and Wardrop equilibria
cites work: Algorithms, games, and the internet
cites work: Integer Programming and Combinatorial Optimization
cites work: The price of anarchy is independent of the network topology
cites work: Q5501360
cites work: Selfish routing with atomic players
cites work: How bad is selfish routing?
cites work: Bounding the inefficiency of equilibria in nonatomic congestion games
DOI: 10.1007/S11067-007-9017-8
description: scientific article; zbMATH DE number 5565189