Wardrop equilibria with risk-averse users

Transportation Science

Volumn 44, Issue 1, 2010, Pages 63-86

  Ordóñez, Fernando ^a   Stier Moses, Nicolás E ^b  

^a University of Southern California   (United States)

^b Columbia University ^*  (United States)

Author keywords

Nonadditive cost models; Robust game theory; Wardrop equilibrium under uncertainty

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; COST FUNCTIONS; ECONOMIC AND SOCIAL EFFECTS; GAME THEORY; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION; RISK ANALYSIS;

COLUMN GENERATION APPROACH; COMPUTATIONAL EXPERIMENT; COST MODELS; POLYNOMIALLY SOLVABLE; ROBUST GAME THEORIES; SHORTEST PATH PROBLEM; TRAFFIC ASSIGNMENT PROBLEM; WARDROP EQUILIBRIUM;

COSTS;

EID: 77949289659     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1090.0292     Document Type: Article

References (60)

1. Aashtiani, H. Z., T. L. Magnanti. 1981. Equilibria on a congested transportation network. SIAM J. Algebraic Discrete Methods 2(3) 213-226.
2. Aghassi, M., D. Bertsimas. 2006. Robust game theory. Math. Programming 107B 231-273.
3. Altman, E., T. Boulogne, R. El-Azouzi, T. Jiménez, L. Wynter. 2006. A survey on networking games in telecommunications. Comp. Oper. Res. 33(2) 286-311.
4. Andreatta, G., L. Romeo. 1988. Stochastic shortest paths with recourse. Networks 18 193-204.
5. Ashlagi, I., D. Monderer, M. Tennenholtz. 2006. Resource selection games with unknown number of players. Proc. Fifth Internat. Joint Conf. Autonomous Agents Multiagent Systems. ACM, New York, 819-825.
6. Atamtürk, A., M. Zhang. 2007. Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4) 662-673.
7. Bar-Gera, H. 2002. Transportation network test problems. Accessed November 2009, http://www.bgu.ac.il/~bargera/tntp/.
8. Beckmann, M. J., C. B. McGuire, C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
9. Bell, M. G. H., C. Cassir. 2002. Risk-averse user equilibrium traffic assignment: An application of game theory. Transportation Res. 36B(8) 671-681.
10. Ben-Tal, A., A. Nemirovski. 1997. Robust truss topology design via semidefinite programming. SIAM J. Optim. 7(4) 991-1016.
11. Ben-Tal, A., A. Nemirovski. 1998. Robust convex optimization. Math. Oper. Res. 23(4) 769-805.
12. Ben-Tal, A., B. Golany, A. Nemirovski, J.-P. Vial. 2005. Supplierretailer flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3) 248-273.
13. Bergendorff, P., D. W. Hearn, M. V. Ramana. 1997. Congestion toll pricing of traffic networks. P. M. Pardalos, D. W. Hearn, W. W. Hager, eds. Network Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 450. Springer, Berlin, 51-71.
14. Bertsekas, D. P., J. N. Tsitsiklis. 1991. An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3) 580-595.
15. Bertsimas, D., M. Sim. 2003. Robust discrete optimization and network flows. Math. Programming Ser. B 98 49-71.
16. Bertsimas, D., A. Thiele. 2004. A robust optimization approach to supply chain management. D. Bienstock, G. Nemhauser, eds. Proc. 10th Internat. Integer Programming Combin. Optim. Conf., IT Lecture Notes in Computer Science, Vol. 3064. Springer, Berlin/Heidelberg, 86-100.
17. Bertsimas, D., A. Thiele. 2006. A robust optimization approach to inventory theory. Oper. Res. 54(1) 150-168.
18. Braess, D. 1968. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12 258-268. [English translation: Braess, .
19. D., A. Nagurney, T. Wakolginger 2005. On a paradox of traffic planning. Transportation Sci. 39(4) 446-450].
20. Bureau of Public Roads. 1964. Traffic assignment manual. U.S. Department of Commerce, Urban Planning Division, Washington, DC.
21. Dafermos, S. C. 1980. Traffic equilibrium and variational inequalities. Transportation Sci. 14(1) 42-54.
22. Daganzo, C. Y. Sheffi. 1977. On stochastic models of traffic assignment. Transportation Sci. 11(3) 253-274.
23. de Palma, A., Y. Nesterov. 1998. Optimization formulations and static equilibrium in congested transportation networks. CORE Discussion Paper 9861, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
24. de Palma, A., N. Picard. 2005. Route choice decision under travel time uncertainty. Transportation Res. 39A(4) 295-324.
25. Dial, R. B. 1971. A probabilistic multi-path traffic assignment algorithm which obviates path enumeration. Transportation Res. 5(2) 83-111.
26. El-Ghaoui, L., H. Lebret. 1997. Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18 1035-1064.
27. El-Ghaoui, L., M. Oks, F. Oustry. 2003. Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. 51(4) 543-556.
28. El-Ghaoui, L., F. Oustry, H. Lebret. 1998. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1) 33-52.
29. Fan, Y. Y., R. E. Kalaba, J. E. Moore. 2005a. Arriving on time. J. Optim. Theory Appl. 127(3) 497-513.
30. Fan, Y. Y., R. E. Kalaba, J. E. Moore. 2005b. Shortest paths in stochastic networks with correlated link costs. Comput. Math. Appl. 49 1549-1564.
31. Ferris, M. C., O. L. Mangasarian, J. S. Pang. 2001. Complementarity: Applications, Algorithms and Extensions, Vol. 50, Applied Optimization. Kluwer Academic, Dordrecht, The Netherlands.
32. Fleischer, L., K. Jain, M. Mahdian. 2004. Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Los Alamitos, CA, 277-285.
33. Fourer, R., D. M. Gay, B. W. Kernighan. 2002. AMPL: A Modeling Language for Mathematical Programming. Brooks/Cole, Pacific Groove, CA.
34. Gabriel, S., D. Bernstein. 1997. The traffic equilibrium problem with nonadditive path costs. Transportation Sci. 31 337-348. (Pubitemid 127601475)
35. Goldfarb, D., G. Iyengar. 2003. Robust portfolio selection problems. Math. Oper. Res. 28(1) 1-38.
36. Harsanyi, J. C. 1967. Games with incomplete information played by "Bayesian" players, I-III. Part I. The basic model. Management Sci. 14(3) 159-182.
37. Harsanyi, J. C. 1968. Games with incomplete information played by "Bayesian" players, I-III. Part II. Bayesian equilibrium points. Management Sci. 14(5) 320-334.
38. Hayashi, S., N. Yamashita, M. Fukushima. 2005. Robust Nash equilibria and second-order cone complementarity problems. J. Nonlinear Convex Anal. 6 283-296.
39. Holmström, B., R. B. Myerson. 1983. Efficient and durable decision rules with incomplete information. Econometrica 51 1799-1820. ILOG. 2005. CPLEX. http://www.ilog.com.
40. Jahn, O., R. H. Möhring, A. S. Schulz, N. E. Stier-Moses. 2005. System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53(4) 600-616.
41. Liu, H., X. Ban, B. Ran, P. Mirchandani. 2002. An analytical dynamic traffic assignment model with stochastic network and travelers' perceptions. Transportation Res. Record 1783 125-133.
42. Lo, H. K., Y.-K. Tung. 2003. Network with degradable links: Capacity analysis and design. Transportation Res. 37B(4) 345-363.
43. Marcotte, P., D. L. Zhu. 2009. Existence and computation of optimal tolls in multiclass network equilibrium problems. Oper. Res. Lett. 37 211-214.
44. Mirchandani, P. B., H. Soroush. 1987. Generalized traffic equilibrium with probabilistic travel times and perceptions. Transportation Sci. 21 133-152.
45. Nagurney, A. 1999. Network Economics: A Variational Inequality Approach, 2nd ed. Kluwer Academic, Dordrecht, The Netherlands.
46. Nie, Y., X. Wu. 2009. Shortest path problem considering on-time arrival probability. Transportation Res. 43B 597-613.
47. Nikolova, E., M. Brand, D. R. Karger. 2006. Optimal route planning under uncertainty. Proc. Internat. Conf. Automated Planning Scheduling, Cumbria, UK, 131-141.
48. Noland, R. B., K. Small, P. Koskenoja, X. Chu. 1998. Simulating travel reliability. Regional Sci. Urban Econom. 28(5) 535-564.
49. Ordóñez, F., N. E. Stier-Moses. 2007a. Robust wardrop equilibrium. Proc. First Inter. Conf. Network Control Optim. Lecture Notes in Comput. Sci., Vol. 4465. Springer, Berlin, 247-256.
50. Ordóñez, F., J. Zhao. 2007b. Robust capacity expansion of network flows. Networks 50(2) 136-145.
51. Patriksson, M. 1994. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands.
52. Roughgarden, T. 2002. How unfair is optimal routing? Proc. 13th Annual ACM-SIAM Sympos. Discrete Algorithms, SIAM, Philadelphia, 203-204.
53. Roughgarden, T., É. Tardos. 2002. How bad is selfish routing? J. ACM 49 236-259.
54. Sheffi, Y. 1985. Urban Transportation Networks. Prentice-Hall, Englewood, NJ.
55. Smith, M. J. 1979. The existence, uniqueness and stability of traffic equilibria. Transportation Res. 13B 295-304.
56. Uchida, T., Y. Iida. 1993. Risk assignment: A new traffic assignment model considering risk of travel time variation. C. F. Daganzo, ed. Proc. 12th Internat. Sympos. Transportation Traffic Theory. Elsevier, Amsterdam, 89-105.
57. Ukkusuri, S. V., S. T. Waller. 2010. Approximate expressions for network performance under demand uncertainty. Transportation Lett. Forthcoming.
58. Vanderbei, R. J. 1999. LOQO: An interior point code for quadratic programming. Optim. Methods Software 12 451-484.
59. Wardrop, J. G. 1952. Some theoretical aspects of road traffic research. Proc. Institute of Civil Engineers, Part II, Vol. 1, 325-378.
60. Yang, H., H.-J. Huang. 2004. The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transportation Res. 38B 1-15.