-
66浏览
-
0点赞
-
0收藏
-
0分享
-
0下载
-
0评论
-
引用
期刊论文
Network Characterizations for Excluding Braess’s Paradox
Theory of Computing Systems volume,2016,59():747–780 | 2016年10月14日 | https://doi.org/10.1007/s00224-016-9710-4
Braess’s paradox exposes a counterintuitive phenomenon that when travelers selfishly choose their routes in a network, removing links can improve the 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 strengthen Milchtaich’s series-parallel characterization (Milchtaich, Games Econom. Behav. 57(2), 321–346 (2006)) for the single-commodity undirected case.
学者未上传该成果的PDF文件,请等待学者更新
本学者其他成果
同领域成果