Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing

DOI10.1007/978-3-319-42634-1_3zbMath1479.90045OpenAlexW2488057927MaRDI QIDQ2817846

Zhuo Diao, Xu-jin Chen

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_3

zbMATH Keywords

nonatomic selfish routingmulti-commodity networksweakly Pareto optimalextension-parallel networkssingle-commodity networks

Mathematics Subject Classification ID

Noncooperative games (91A10) Deterministic network models in operations research (90B10)

Cites Work

• Strong equilibrium in network congestion games: increasing versus decreasing costs
• 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.
• How bad is selfish routing?
• Excluding Braess’s Paradox in Nonatomic Selfish Routing
• The Recognition of Series Parallel Digraphs
• Über ein Paradoxon aus der Verkehrsplanung

Related Items (2)

A Characterization of Undirected Graphs Admitting Optimal Cost Shares ⋮ On weak Pareto optimality of nonatomic routing networks

This page was built for publication: Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing