Abstract
The Braess Paradox is a well known phenomenon in transportation engineering: adding a new road to a traffic network may not reduce the total travel time in it. In fact, some road users may be better off but they contribute to an increase in travel time for other users. This situation happens because drivers do not face the true social cost of an action. Previous works have shown that in commuting scenarios, where people use the same traffic network routinely, a continuous learning and adaptation process is a realistic scenario: road users can adapt to the traffic conditions and will eventually learn to avoid the situation in which the cost is higher. However, this learning process can take a long time. Moreover, because the process is very sensible to the cost function and to the number of agents using the network, a more efficient approach to distribute agents in the network is to let the traffic control center to acquire and process data regarding the occupancy of the available roads and compute the optimal distribution (from the point of view of the whole system). With this information, manipulated information can be passed to the road users. The interesting point is what happens when drivers simultaneously receive this kind of information and are involved in learning processes. Thus this paper reports results obtained after simulations of several situations related to the Braess scenario: only uninformed agents using the network; with different shares of uninformed agents; drivers adapting to the traffic conditions under different learning probabilities; drivers receiving forecast; and drivers receiving manipulated information.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akamatsu, T. dynamic traffic equilibrium assignment paradox. Transportation Research B 6 (2000), 515–531.
Arnott, R., and Small, K. The economics of traffic congestion. American Scientist 82 (1994), 446–455.
Bazzan, A. L. C., and Klügl, F. Learning to behave socially and avoid the braess paradox in a commuting scenario. In 5th Workshop on Decision Theoretic and Game Theoretic Agents (July 2003), S. Parsons and P. Gmytrasiewicz, Eds., pp. 107–112. held together with AAMAS 2003.
Braess, D. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12 (1968), 258.
Hardin, G. The tragedy of the commons. Science 162 (1968), 1243–1248.
Klügl, F., and Bazzan, A. L. C. Simulation of adaptive agents: Learning heuristics for route choice in a commuter scenario. In Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (Bologna, Italy, July 2002), vol. 1, ACM Press, pp. 217–218. extended abstract.
Pas, E. I., and Principio, S. L. Braess’ paradox: Some new insights. Transportation Research B 31,3 (1997), 265–276.
Penchina, C. M. Braess paradox: maximum penalty in a minimal critical network. Transportation Research A 31,5 (1997), 379–388.
Smith, M. J. In a road network, increasing delay locally can reduce delay globally. Transportation Research 12,6 (1978), 419–422.
Tumer, K., and Wolpert, D. Collective intelligence and braess’ paradox. In Proceedings of the AAAI (2000), AAAI Press.
Yang, H., and Bell, M. G. H. A capacity paradox in network design and how to avoid it. Transportation Research A 32,7 (1998), 539–545.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Birkhäuser Verlag
About this paper
Cite this paper
Bazzan, A.L.C., Klügl, F. (2005). Reducing the Effects of the Braess Paradox with Information Manipulation. In: Klügl, F., Bazzan, A., Ossowski, S. (eds) Applications of Agent Technology in Traffic and Transportation. Whitestein Series in Software Agent Technologies. Birkhäuser Basel. https://doi.org/10.1007/3-7643-7363-6_6
Download citation
DOI: https://doi.org/10.1007/3-7643-7363-6_6
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7258-3
Online ISBN: 978-3-7643-7363-4
eBook Packages: Computer ScienceComputer Science (R0)