Related papers: When does additional information lead to longer tr…
The Braess paradox describes the counterintuitive situation that the addition of new roads to road networks can lead to higher travel times for all network users. Recently we could show that user optima leading to the paradox exist in…
Braess' paradox has been shown to appear rather generically in many systems of transport on networks. It is especially relevant for vehicular traffic where it shows that in certain situations building a new road in an urban or highway…
To systematically study the implications of additional information about routes provided to certain users (e.g., via GPS-based route guidance systems), we introduce a new class of congestion games in which users have differing information…
The Braess paradox can be observed in road networks used by selfish users. It describes the counterintuitive situation in which adding a new, per se faster, origin-destination connection to a road network results in increased travel times…
We study the Braess paradox in the transport network as originally proposed by Braess with totally asymmetric exclusion processes (TASEPs) on the edges. The Braess paradox describes the counterintuitive situation in which adding an edge to…
We study traffic networks with multiple origin-destination pairs, relaxing the simplifying assumption of agents having complete knowledge of the network structure. We identify a ubiquitous class of networks, i.e., rings, for which we can…
The Braess's Paradox (BP) is the observation that adding one or more roads to the existing road network will counter-intuitively increase traffic congestion and slow down the overall traffic flow. Previously, the existence of the BP is…
The well-known Braess paradox in congestion games states that adding an additional road to a transportation network may increase the total travel time, and consequently decrease the overall efficiency. Motivated by this, this paper presents…
The Braess paradox is a counter-intuitive phenomenon whereby adding roads to a network results in higher travel time at equilibrium. In this paper we present an algorithm to detect the occurrence of this paradox in real-world networks with…
The emergence of the Braess' paradox in road traffic systems demonstrates the positive effect of transportation planning in improving efficiency. By contrast, the phenomenon has rarely been examined in pedestrian evacuation traffic. Yet the…
In this paper we investigate the impact of path additions to transport networks with optimised traffic routing. In particular, we study the behaviour of total travel time, and consider both self-interested routing paradigms, such as User…
Well known in the theory of network flows, Braess paradox states that in a congested network, it may happen that adding a new path between destinations can increase the level of congestion. In transportation networks the phenomenon results…
Braess's paradox -- where adding network capacity increases travel time -- is typically attributed to selfish agents. Although eusocial colonies maximize collective fitness, we find experimentally that \emph{Diacamma indicum} ants exhibit…
The objective of this paper is to study the effect of travel time information on day-to-day driver route choice behavior. A real-world experimental study is designed to have participants repeatedly choose between two alternative routes for…
We revisit the familiar scenario involving two parties in relative motion, in which Alice stays at rest while Bob goes on a journey at speed $\beta c$ along an arbitrary trajectory and reunites with Alice after a certain period of time. It…
Reliable functioning of supply and transport networks fundamentally support many non-equilibrium dynamical systems, from biological organisms and ecosystems to human-made water, gas, heat, electricity and traffic networks. Strengthening an…
The classical network configuration introduced by Braess in 1968 is of fundamental significance because Valiant and Roughgarden showed in 2006 that `the "global" behaviour of an equilibrium flow in a large random network is similar to that…
We study a routing game in an environment with multiple heterogeneous information systems and an uncertain state that affects edge costs of a congested network. Each information system sends a noisy signal about the state to its subscribed…
In the stochastic exploration of geometrically embedded graphs, intuition suggests that providing a shortcut between a pair of nodes reduces the mean first passage time of the entire graph. Counterintuitively, we find a Braess paradox…
Multiplex networks are representations of multilayer interconnected complex networks where the nodes are the same at every layer. They turn out to be good abstractions of the intricate connectivity of multimodal transportation networks,…