Navigating congested networks with variable demand: Experimental evidence

被引:31
|
作者
Rapoport, Amnon
Mak, Vincent
Zwick, Rami
机构
[1] Univ Arizona, Coll Business & Publ Adm, Dept Management & Policy, Tucson, AZ 85721 USA
[2] Hong Kong Univ Sci & Technol, Dept Mkt, Kowloon, Hong Kong, Peoples R China
关键词
Braess paradox; changes in demand; experimental study; traffic networks;
D O I
10.1016/j.joep.2006.06.001
中图分类号
F [经济];
学科分类号
02 ;
摘要
We consider traffic networks with a common origin and common destination that are subject to congestion and susceptible to the Braess paradox. Users of such networks choose their routes simultaneously in an attempt to minimize travel cost. A counterintuitive implication of the equilibrium analysis of the users' route choices is that, as demand for the network increases, the addition of a new edge to the network may be beneficial to all the users when the network congestion is relatively low (n = 10 in our study), harmful when congestion is moderate (n = 20), and have no effect when congestion is high (n = 40). Using a within-subjects design with payoff contingent on performance, we test this hypothesis in a network experiment and report evidence that strongly supports it. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:648 / 666
页数:19
相关论文
共 50 条
  • [31] Dynamic analysis of congested TCP networks
    Chait, Y
    Hollot, CV
    Misra, V
    Han, HZ
    Halevi, Y
    PROCEEDINGS OF THE 2002 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2002, 1-6 : 2430 - 2435
  • [32] Cascading dynamics in congested complex networks
    Wang, J.
    Liu, Y. -H.
    Jiao, Y.
    Hu, H. -Y.
    EUROPEAN PHYSICAL JOURNAL B, 2009, 67 (01): : 95 - 100
  • [33] ELECTRONIC ROUTE GUIDANCE IN CONGESTED NETWORKS
    VANAERDE, M
    BLUM, Y
    ITE JOURNAL-INSTITUTE OF TRANSPORTATION ENGINEERS, 1988, 58 (08): : 33 - 37
  • [34] Improving scheduling performance in congested networks
    Husen, Arif
    Chaudary, Muhammad Hasanain
    Ahmad, Farooq
    Alam, Muhammad Imtiaz
    Sohail, Abid
    Asif, Muhammad
    PEERJ COMPUTER SCIENCE, 2021, 7
  • [35] Risk Limiting Dispatch in Congested Networks
    Znang, Baosen
    Rajagopal, Ram
    Tse, David
    2013 IEEE 52ND ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2013, : 7568 - 7575
  • [36] Cascading dynamics in congested complex networks
    J. Wang
    Y.-H. Liu
    Y. Jiao
    H.-Y. Hu
    The European Physical Journal B, 2009, 67 : 95 - 100
  • [37] Asymptotic analysis of congested communication networks
    Bonnans, JF
    Haddou, M
    MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (03) : 409 - 426
  • [38] Risk Limiting Dispatch in Congested Networks
    Rajagopal, Ram
    Tse, David
    Zhang, Baosen
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 1900 - 1907
  • [39] QoS Optimization in Congested Multimedia Networks
    Mancas, Catalina
    Mocanu, Mihai
    2013 36TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2013, : 38 - 42
  • [40] UTILITY OPTIMIZATION IN CONGESTED QUEUEING NETWORKS
    Walton, N. S.
    JOURNAL OF APPLIED PROBABILITY, 2011, 48 (01) : 68 - 89