Dario Fiorenza

A Decremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets

Braess paradox originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges. The graph-theoretic property of networks suffering from the Braess paradox was called vulnerability by Roughgarden in 2006; it was then characterized and algorithmically checked both for undirected and...

Dynamic Algorithms for Detecting Vulnerability to the Braess Paradox in Multi-Commodity Networks

An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets

Braess paradox is a well-known phenomenon that originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges. The possibility of having the paradox was called vulnerability by Roughgarden in 2006 and was characterized later on by graph-theoretical notions, both for undirected an...