Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
From MaRDI portal
Publication:2817846
DOI10.1007/978-3-319-42634-1_3zbMath1479.90045OpenAlexW2488057927MaRDI QIDQ2817846
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
nonatomic selfish routingmulti-commodity networksweakly Pareto optimalextension-parallel networkssingle-commodity networks
Related Items
A Characterization of Undirected Graphs Admitting Optimal Cost Shares, On weak Pareto optimality of nonatomic routing networks
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