Braess's Paradox in Large Random Graphs

被引：19

作者：

Valiant, Gregory ^{[2
]}

Roughgarden, Tim ^{[1
]}

机构：

[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA

[2] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA

来源：

RANDOM STRUCTURES & ALGORITHMS | 2010年 / 37卷 / 04期

关键词：

Braess's Paradox; random graphs; selfish routing; traffic equilibria;

D O I：

10.1002/rsa.20325

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Braess's Paradox is the counterintuitive fact that removing edges from a network with "selfish routing" can decrease the latency incurred by traffic in an equilibrium flow. We prove that Braess's Paradox is likely to occur in a natural random network model: with high probability, there is a traffic rate and a set of edges whose removal improves the latency of traffic in an equilibrium flow by a constant factor. (C) 2010 Wiley Periodicals, Inc. Random Struct. Alg., 37, 495-515, 2010

引用

页码：495 / 515

页数：21

共 50 条

[21] An Empirical Research on Braess's Paradox of Transportation Network
Xue, Yi
Liu, Shan
Cao, Zhengzheng
PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE OF MODELLING AND SIMULATION (ICMS2011), VOL 1, 2011, : 302 - 305
[22] Dynamic Braess's Paradox in Complex Communication Networks
Xia, Yongxiang
Hill, David J.
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2013, 60 (03) : 172 - 176
[23] A new scenario for Braess's paradox in power grids
Khramenkov, V. A.
Dmitrichev, A. S.
Nekorkin, V. I.
CHAOS, 2022, 32 (11)
[24] Airway network management using Braess's Paradox
Ma, Chunyao
Cai, Qing
Alam, Sameer
Sridhar, Banavar
Duong, Vu N.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2019, 105 : 565 - 579
[25] Braess paradox at the mesoscopic scale
Sousa, A. A.
Chaves, Andrey
Farias, G. A.
Peeters, F. M.
PHYSICAL REVIEW B, 2013, 88 (24):
[26] A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Cenciarelli, Pietro
Gorla, Daniele
Salvo, Ivano
ALGORITHMICA, 2019, 81 (04) : 1535 - 1560
[27] Braess’s paradox and programmable behaviour in microfluidic networks
Daniel J. Case
Yifan Liu
István Z. Kiss
Jean-Régis Angilella
Adilson E. Motter
Nature, 2019, 574 : 647 - 652
[28] KEMENY'S CONSTANT AND AN ANALOGUE OF BRAESS' PARADOX FOR TREES
Kirkland, Steve
Zeng, Ze
ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2016, 31 : 444 - 464
[29] Braess's paradox and programmable behaviour in microfluidic networks
Case, Daniel J.
Liu, Yifan
Kiss, Istvan Z.
Angilella, Jean-Regis
Motter, Adilson E.
NATURE, 2019, 574 (7780) : 647 - +
[30] Collective intelligence and Braess' paradox
Tumer, K
Wolpert, D
SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), 2000, : 104 - 109

← 1 2 3 4 5 →