Abstract

The Braess Paradox (BP) is a counterintuitive finding that degrading a network that is susceptible to congestion may decrease the equilibrium travel cost for each of its users. We illustrate this paradox with two networks: a basic network with four alternative routes from a single origin to a single destination, and an augmented network with six alternative routes. We construct the equilibrium solutions to these two networks, which jointly give rise to the paradox, and subject them to experimental testing. Our purpose is to test the generality of the BP when the network is enriched as well as the effects of the information provided to the network users when they conclude their travel. To this end, we compare experimentally two information conditions when each of the two networks is iterated in time. Under public monitoring each user is accurately informed of the route choices and payoffs of all the users, whereas under private monitoring she is only informed of her own payoff. Under both information conditions, over iterations of the basic and augmented games, aggregate route choices converge to equilibrium.