A selfish routing based network improvement problem

DOI10.1007/s11424-011-8156-7zbMath1219.90030OpenAlexW2141954300WikidataQ57436899 ScholiaQ57436899MaRDI QIDQ545450

Shu-Cherng Fang, Binwu Zhang

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

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

Cites Work

• Unnamed Item
• The shortest path improvement problems under Hamming distance
• How much can taxes help selfish routing?
• How bad is selfish routing?
• On the relationship between Nash—Cournot and Wardrop equilibria
• Stackelberg Scheduling Strategies
• Equilibrium points in n -person games
• The price of anarchy is independent of the network topology

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