How bad is selfish routing?
Explore this paper's citation graph
- Type
- article
- Published
- 2000-11-12
- Cited by
- 2,044
- References
- 56
- Access
- Open access
- OpenAlex
- https://openalex.org/W2149497768
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:206560095
Keywords
Traverse, Computer network, Latency (audio), Network traffic control, Computer science
References
- Sustainable Transportation Networks
- Optimal Time-Critical Scheduling via Resource Augmentation
- Speed is as powerful as clairvoyance
- Graphentheoretische Methoden und ihre Anwendungen
- Road to ruin
- PREVALENCE OF BRAESS' PARADOX
- Data networks (2nd ed.)
- Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods
- Stable flows in transportation networks
- Stable Dynamics in Transportation Systems
- A Generic Analysis of Selfish Routing
- Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- The existence, uniqueness and stability of traffic equilibria
- On the relationship between Nash - Cournot and Wardrop equilibria
- Über ein Paradoxon aus der Verkehrsplanung
- Paradoxical behaviour of mechanical and electrical networks
- Traffic assignment problem for a general network
- Stackelberg scheduling strategies
- The Price of Selfish Routing
- On the algebra of networks
Cited by
- Buyer-supplier games: Optimization over the core
- The price of anarchy of serial cost sharing and other methods
- Optimization in the private value model: competitive analysis applied to auction design
- Decentralized Stochastic Planning with Anonymity in Interactions
- Pricing Networks with Selfish Routing
- The Impact of Stackelberg Routing in General Networks
- Practical and efficient internet routing with competing interests
- Strong mediated equilibrium
- Application de la théorie des jeux à l'optimisation du routage réseau - solutions algorithmiques. (Game theory applied to routing in networks - algorithmic solutions)
- Equilibrium dynamic systems integration
- When Do Potential Functions Exist in Heterogeneous Routing Games
- The Economic Implications of Edge-Directed Routing: A Network Operator's Perspective
- A Paradox in a Queueing Network with State-Dependent Routing and Loss
- A New Look at Selfish Routing
- A Decentralized Route Guidance Algorithm in Urban Transportation Networks
- Truthful Mechanism Design for Cooperative Cost Sharing and Congestion Games
- Dynamisches eigennütziges RoutingDynamic Selfish Routing
- Modular Structures, Robustness and Protection of Complex Networks: Theory, Complexity and Algorithms
- Optimisation dans les réseaux : de l'approximation polynomiale à la théorie des jeux. (Optimization in networks: from polynomial time approximation to game theory)
- Extensions and refinements of stabilization
Related papers
- Computer Network Congestion Control Method of High Efficiency
- Simulation and Application of Wireless Network Congestion Control
- A congestion control system for an advanced intelligent network
- Study on Internet Congestion Control Algorithm
- An Effective Congestion Control Algorithm based on Traffic Assignment and Reassignment in Wireless Sensor Network
- A Flow Control Method of Wireless Sensor Network Rate with Certainly Fit
- Network congestion control and its impact on video streaming QoE
- TCP-QNCC: congestion control algorithm based on deep Q-network