Excluding braess’s paradox in nonatomic selfish routing

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Braess’s paradox exposes a counterintuitive phenomenon that when travelers selfishly choose their routes in a network, removing links can improve overall network performance. Under the model of nonatomic selfish routing, we characterize the topologies of k-commodity undirected and directed networks in which Braess’s paradox never occurs. Our results generalize Milchtaich’s series-parallel characterization for the single-commodity undirected case.

Cite

CITATION STYLE

APA

Chen, X., Diao, Z., & Hu, X. (2015). Excluding braess’s paradox in nonatomic selfish routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9347, pp. 219–230). Springer Verlag. https://doi.org/10.1007/978-3-662-48433-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free