A selfish routing based network improvement problem

DOI10.1007/S11424-011-8156-7MaRDI QIDQ545450zbMATH OpenOpenAlexWikidataFDO

Authors Binwu Zhang, Shu-Cherng Fang

Publication date 22 June 2011

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-011-8156-7

zbMATH Keywords

Nash equilibriumNP-hardprice of anarchyselfish routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Network Improvement for Equilibrium Routing
• On the severity of Braess's paradox: designing networks for selfish users is hard
• How bad is selfish routing?
• Efficient methods for selfish network design
• Efficient Methods for Selfish Network Design

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Equilibrium points in n -person games
• How bad is selfish routing?
• How much can taxes help selfish routing?
• On the relationship between Nash—Cournot and Wardrop equilibria
• Stackelberg Scheduling Strategies
• The price of anarchy is independent of the network topology
• The shortest path improvement problems under Hamming distance

Cited in

(2)

• Network Improvement for Equilibrium Routing
• Selfish Routing in Capacitated Networks

This page was built for publication: A selfish routing based network improvement problem

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