Network Characterizations for Excluding Braess's Paradox
文献类型：期刊论文
| 作者 | Chen, Xujin ; Diao, Zhuo; Hu, Xiaodong
|
| 刊名 | THEORY OF COMPUTING SYSTEMS
 |
| 出版日期 | 2016-11-01 |
| 卷号 | 59期号:4页码:747-780 |
| 关键词 | Nonatomic selfish routing Braess's paradox Single-commodity network Multcommodity network Series-parallel graph |
| ISSN号 | 1432-4350 |
| DOI | 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. |
| 资助项目 | NNSF of China[11531014] ; NNSF of China[11222109] |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000388716100011 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/24175]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。