Shape and performance of fastest paths over networks with interacting selfish agents
{{output}}
We study the evolution of the fastest paths (FPs) in transportation networks under increasing congestion. Moving from the common edge-based to a path-based analysis, we examine the directed FPs connecting random origin-destination pairs as traffic grows. We de... ...