Selfish Routing in Capacitated Networks
According to Wardrop's first principle, agents in a congested network choose their routes selfishly, a behavior that is captured by the Nash equilibrium of the underlying noncooperative game. A Nash equilibrium does not optimize an...
Main Authors: | Correa, Jose R., Schulz, Andreas S., Stier Moses, Nicolas E. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3533 |
Similar Items
-
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
by: Correa, Jose R., et al.
Published: (2004) -
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
by: Jahn, Olaf, et al.
Published: (2004) -
On Nash Equilibria in Non-Cooperative All-Optical Networks
by: Vittorio Bilò, et al.
Published: (2021-01-01) -
Selfish Routing Game-Based Multi-Resource Allocation and Fair Scheduling of Indivisible Jobs in Edge Environments
by: Hajar Siar, et al.
Published: (2022-01-01) -
Stochastic Game Analysis of Cooperation and Selfishness in a Random Access Mechanism
by: Ahmed Boujnoui, et al.
Published: (2022-02-01)