Efficiency of atomic splittable selfish routing with polynomial cost functions

DOI10.1007/S11067-007-9017-8MaRDI QIDQ1024062zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

networkequilibriumprice of anarchyselfish routingsystem optimum

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(8)

• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• Cost-sharing in generalised selfish routing
• 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)