lec24_soda_03

lec24_soda_03 - SELFISH ROUTING IN CAPACITATED NETWORKS ´...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: SELFISH ROUTING IN CAPACITATED NETWORKS ´ ´ JOSE R. CORREA, ANDREAS S. SCHULZ, AND NICOLAS E. STIER MOSES Sloan School of Management and Operations Research Center Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge, MA 02139-4307 Abstract. According to Wardrop’s first principle, agents in a congested network choose their routes selfishly, a behavior that is captured by the Nash equilibrium of the underlying noncooperative game. A Nash equilibrium does not optimize any global criterion per se, and so there is no apparent reason why it should be close to a solution of minimal total travel time, i.e. the system optimum. In this paper, we offer positive results on the efficiency of Nash equilibria in traffic networks. In contrast to prior work, we present results for networks with capacities and for latency functions that are nonconvex, nondifferentiable, and even discontinuous. The inclusion of upper bounds on arc flows has early been recognized as an important means to provide a more accurate description of traffic flows. In this more general model, multiple Nash equilibria may exist and an arbitrary equilibrium does not need to be nearly efficient. Nonetheless, our main result shows that the best equilibrium is as efficient as in the model without capacities. Moreover, this holds true for broader classes of travel cost functions than considered hitherto. Date : June 2003; revised February 2004. 2000 Mathematics Subject Classification. Primary 90C35; 90B10, 90B20, 90C25, 90C27, 91A10, 91A13, 91A43. Key words and phrases. Selfish Routing, Price of Anarchy, Traffic Assignment, System Optimum, Nash Equilibrium, Performance Guarantee, Multicommodity Flow. OR/MS classification. Games: Noncooperative; Mathematics: Combinatorics; Networks/graphs: Multicom- modity, Theory; Transportation: Models. 1 2 ´ ´ JOSE R. CORREA, ANDREAS S. SCHULZ, AND NICOLAS E. STIER MOSES 1. Introduction It is a common behavioral assumption in the study of traffic networks modeling congestion effects and therefore featuring flow-dependent link travel times, that travelers choose routes that they perceive as being the shortest under the prevailing traffic conditions. In other words, travelers minimize their individual travel times (Kohl 1841). The situation resulting from these individual decisions is one in which drivers cannot reduce their journey times by unilaterally choosing another route, which prompted Knight (1924) to call the resulting traffic pattern an equilibrium. Nowadays it is indeed known as the user equilibrium (Dafermos and Sparrow 1969), and it is effectively thought of as a steady-state evolving after a transient phase in which travelers successively adjust their route choices until a situation with stable route travel costs and route flows has been reached (Larsson and Patriksson 1999). In a seminal contribution, Wardrop (1952) stated two principles that formalize this notion of equilibrium and the alternative postulate of the minimization...
View Full Document

This note was uploaded on 12/04/2011 for the course ESD 15.094 taught by Professor Jiesun during the Spring '04 term at MIT.

Page1 / 28

lec24_soda_03 - SELFISH ROUTING IN CAPACITATED NETWORKS ´...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online