Corelab Seminar

Kirgiakos Sergis (NTUA)
Braess's Paradox in Large Random Graphs

Braess's paradox is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With this work, we give a small description of the paradox, give definitions of the graphs that do or do not suffer from the paradox (Paradox-ridden vs Paradox-free instances) and finally try to answer the question: 'Considering a large random graph, how possible is it that the Braess's paradox can occur?'