Network Topology That Excludes Braess's Paradox and Maintains Monotonicity in Flows Over Time
It is proved that removing edges from these networks never decreases the maximum equilibrium latency, which establishes a necessary and sufficient condition: a network does not admit Braess's paradox for flow over time if and only if it is a chain of BPAs.