CSpace  > 应用数学研究所
Network Characterizations for Excluding Braess's Paradox
Chen, Xujin; Diao, Zhuo; Hu, Xiaodong
2016-11-01
发表期刊THEORY OF COMPUTING SYSTEMS
ISSN1432-4350
卷号59期号:4页码:747-780
摘要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.
关键词Nonatomic selfish routing Braess's paradox Single-commodity network Multcommodity network Series-parallel graph
DOI10.1007/s00224-016-9710-4
语种英语
资助项目NNSF of China[11531014] ; NNSF of China[11222109]
WOS研究方向Computer Science ; Mathematics
WOS类目Computer Science, Theory & Methods ; Mathematics
WOS记录号WOS:000388716100011
出版者SPRINGER
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/24176
专题应用数学研究所
通讯作者Chen, Xujin
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Chen, Xujin,Diao, Zhuo,Hu, Xiaodong. Network Characterizations for Excluding Braess's Paradox[J]. THEORY OF COMPUTING SYSTEMS,2016,59(4):747-780.
APA Chen, Xujin,Diao, Zhuo,&Hu, Xiaodong.(2016).Network Characterizations for Excluding Braess's Paradox.THEORY OF COMPUTING SYSTEMS,59(4),747-780.
MLA Chen, Xujin,et al."Network Characterizations for Excluding Braess's Paradox".THEORY OF COMPUTING SYSTEMS 59.4(2016):747-780.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chen, Xujin]的文章
[Diao, Zhuo]的文章
[Hu, Xiaodong]的文章
百度学术
百度学术中相似的文章
[Chen, Xujin]的文章
[Diao, Zhuo]的文章
[Hu, Xiaodong]的文章
必应学术
必应学术中相似的文章
[Chen, Xujin]的文章
[Diao, Zhuo]的文章
[Hu, Xiaodong]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。