Efficient Methods for Selfish Network Design
From MaRDI portal
Recommendations
- Efficient methods for selfish network design
- On the severity of Braess's paradox: designing networks for selfish users is hard
- On the hardness of network design for bottleneck routing games
- Stronger bounds on Braess's paradox and the maximum latency of selfish routing
- Resolving Braess's paradox in random networks
Cited in
(20)- Inefficiencies in network models: a graph-theoretic perspective
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Polynomial recognition of vulnerable multi-commodities
- Escaping Braess's paradox through approximate Caratheodory's theorem
- Resolving Braess's paradox in random networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- scientific article; zbMATH DE number 6381644 (Why is no real title available?)
- Resolving Braess's paradox in random networks
- Braess's paradox in expanders
- Stronger bounds on Braess's paradox and the maximum latency of selfish routing
- Dominated parasitic flow loops in networks
- Near-optimal network design with selfish agents
- On the hardness of network design for bottleneck routing games
- Efficient methods for selfish network design
- Selfish splittable flows and NP-completeness
- On the hardness of network design for bottleneck routing games
- A selfish routing based network improvement problem
- Automata, Languages and Programming
- A faster algorithm for recognizing directed graphs invulnerable to Braess's paradox
- Selfish network creation with non-uniform edge cost
This page was built for publication: Efficient Methods for Selfish Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321677)
