On weak Pareto optimality of nonatomic routing networks

DOI10.1007/s10878-020-00539-7zbMath1503.91036OpenAlexW3006372211MaRDI QIDQ2082187

Xiao-Dong Hu, Zhuo Diao, Xu-jin Chen

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00539-7

zbMATH Keywords

Nash equilibriummulti-commodity networknonatomic selfish routingweakly Pareto optimal

Mathematics Subject Classification ID

Games involving graphs (91A43) Games with infinitely many players (91A07)

Cites Work

• Worst-case equilibria
• Strong equilibrium in network congestion games: increasing versus decreasing costs
• Network characterizations for excluding Braess's paradox
• Network topology and the efficiency of equilibrium
• Efficient graph topologies in network routing games
• Strong equilibrium in congestion games
• Network structure and strong equilibrium in route selection games.
• Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
• How bad is selfish routing?
• Über ein Paradoxon aus der Verkehrsplanung

This page was built for publication: On weak Pareto optimality of nonatomic routing networks