Excluding Braess’s Paradox in Nonatomic Selfish Routing (Q3449597): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-48433-3_17
+Normal rank
@@ Property / OpenAlex ID @@
+W1853860145
@@ Property / OpenAlex ID: W1853860145 / rank @@
+Normal rank
@@ Property / cites work @@
+Über ein Paradoxon aus der Verkehrsplanung
@@ Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph topologies in network routing games
+Normal rank
@@ Property / cites work @@
+On the hardness of network design for bottleneck routing games
+Normal rank
@@ Property / cites work @@
+Network structure and strong equilibrium in route selection games.
+Normal rank
@@ Property / cites work @@
+Strong equilibrium in network congestion games: increasing versus decreasing costs
+Normal rank
@@ Property / cites work @@
+Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
+Normal rank
@@ Property / cites work @@
+Topological Conditions for Uniqueness of Equilibrium in Networks
+Normal rank
@@ Property / cites work @@
+Network topology and the efficiency of equilibrium
+Normal rank
@@ Property / cites work @@
+On the severity of Braess's paradox: designing networks for selfish users is hard
+Normal rank
@@ Property / cites work @@
+How bad is selfish routing?
@@ Property / cites work: How bad is selfish routing? / rank @@
+Normal rank