Efficiency of atomic splittable selfish routing with polynomial cost functions

DOI10.1007/S11067-007-9017-8zbMATH Open1162.90360OpenAlexW1989955802WikidataQ59297175 ScholiaQ59297175MaRDI QIDQ1024062FDOQ1024062

Authors: Hai Yang, Deren Han, Hong Kam Lo 

Publication date: 16 June 2009

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-007-9017-8

Recommendations

• Selfish routing with atomic players
• The price of routing unsplittable flow
• Routing (un-) splittable flow in games with player-specific affine latency functions
• The price of routing unsplittable flow
• Cost-sharing in generalised selfish routing

zbMATH Keywords

networkequilibriumprice of anarchyselfish routingsystem optimum

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) General equilibrium theory (91B50)

Cites Work

• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology
• How bad is selfish routing?
• Title not available (Why is that?)
• On the relationship between Nash—Cournot and Wardrop equilibria
• Multiple Equilibrium Behaviors on Networks
• Competitive routing in networks with polynomial costs
• Algorithms, games, and the internet
• The price of routing unsplittable flow
• Selfish routing with atomic players
• On the Inefficiency of Equilibria in Congestion Games
• Integer Programming and Combinatorial Optimization

Cited In (8)

• Cost-sharing in generalised selfish routing
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• A mixed traffic assignment problem and its upper bound of efficiency loss
• Self-fulfilling signal of an endogenous state in network congestion games
• Bounding the inefficiency of logit-based stochastic user equilibrium
• The price of anarchy in nonatomic consumption-relevance congestion games
• Congestion control for a system with parallel stations and homogeneous customers using priority passes
• Bounding the inefficiency of the C-logit stochastic user equilibrium assignment

This page was built for publication: Efficiency of atomic splittable selfish routing with polynomial cost functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024062)