Braess's paradox for flows over time (Q372993): Difference between revisions

The authors investigate Braess's paradox for congestion games with flow over time. Among the new results, it is shown that there are networks which do not admit Braess's paradox in Wardrop's model but admit it in the model with the flow over time. It is also discovered that Braess's paradox is not symmetric for flow over time despite its symmetry for games with static flow. In addition some necessary and sufficient conditions for the existence of a Braess's paradox in a network are conjectured and certain partial results towards its verification are established. In particular the condition of existence for Braess's paradox in a network or in its transpose is proved. For a prior version of this article see [Zbl 1310.91044].