A Mathematical Study of the Braess’s Paradox Within a Network Comprising Four Nodes, Five Edges, and Linear Time Functions
Costas Poulios (),
Evangelos Melas (),
Nick C. Poulios (),
Maria Livada () and
John Leventides ()
Additional contact information
Costas Poulios: National and Kapodistrian University of Athens
Evangelos Melas: National and Kapodistrian University of Athens
Nick C. Poulios: University of Leoben
Maria Livada: City University of London
John Leventides: National and Kapodistrian University of Athens
A chapter in Optimization, Discrete Mathematics and Applications to Data Sciences, 2025, pp 223-232 from Springer
Abstract:
Abstract Braess’ paradox asserts that adding new roads to a congested networks can reduce overall performance. The question whether this paradox can be detected to a network is hard to answer. In this chapter, we consider a small network consisting of four nodes and four edges and one more edge is added. We further adopt the assumption that the time function of every edge of the network is linear. In this setting, the difference between the two equilibrium time durations is a multiparametric rational function, and it can be studied via algebraic or statistical tools. Our main result indicates that the Braess’ paradox occurs with probability 50 % $$50\%$$ .
Date: 2025
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-78369-2_12
Ordering information: This item can be ordered from
http://www.springer.com/9783031783692
DOI: 10.1007/978-3-031-78369-2_12
Access Statistics for this chapter
More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().