Eyran J. Gisches

Learn More
The Braess Paradox consists of showing that, in equilibrium, adding a new link that connects two routes running between a common origin and common destination may raise the travel cost for each network user. We report the results of two experiments designed to study whether the paradox is behaviorally realized in two simulated traffic networks that differ(More)
The Braess Paradox (BP) in traffic and communication networks is a powerful illustration of the possible counterintuitive implications of the Nash equilibrium solution. It shows that, paradoxically, when one or more links are added to a weighted network with linear costs that depend on congestion with an attempt to improve it, and each user independently(More)
From transportation to Internet communications, modern life is enveloped in network traffic in which multiple independent users make strategic choices over congestible routes. While there has been phenomenal progress in computer science, economics, and transportation research in characterizing the outcomes in such contexts, most development is based on(More)
In this paper, we examine the impact of information on the routing decisions that drivers make in a congestible two route traffic network. We present a model and theoretical predictions of driver choices in this network and compare outcomes under conditions of full information and partial information regarding the capacities of each route. In certain(More)
The Braess Paradox is a major finding in the equilibrium analysis of routing decentralized traffic in directed networks that are susceptible to congestion. It demonstrates that <i>removing</i> one or more links from a network that is subject to congestion may under certain combinations of cost structure and number of network users <i>decrease</i> the cost(More)
  • 1