A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
From MaRDI portal
Publication:2875605
DOI10.1287/opre.2013.1246zbMath1304.90062OpenAlexW3121734127MaRDI QIDQ2875605
Evdokia Nikolova, Nicolás E. Stier-Moses
Publication date: 11 August 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/16f211b2e2570cc8c9c4ac2f0f4c76c6b3c820bb
Nash equilibriumrisk aversionstochastic networkscongestion gamemean-stdev Wardrop equilibriumnonadditive traffic assignment problem
Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)
Related Items (16)
Assessing the prediction uncertainty in a route optimization model for autonomous maritime logistics ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Sample average approximation of conditional value-at-risk based variational inequalities ⋮ Smart routing of electric vehicles for load balancing in smart grids ⋮ Travel Time Estimation in the Age of Big Data ⋮ The impact of worst-case deviations in non-atomic network routing games ⋮ Price of Anarchy for Mechanisms with Risk-Averse Agents ⋮ \textit{Physarum polycephalum} assignment: a new attempt for fuzzy user equilibrium ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ Wasserstein distributionally robust shortest path problem ⋮ Risk-Averse Selfish Routing ⋮ The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games ⋮ Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks ⋮ Value of Information in Bayesian Routing Games
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Worst-case equilibria
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Robust discrete optimization and network flows
- Potential games
- Shortest paths in stochastic networks with correlated link costs
- Markovian traffic equilibrium
- Arriving on time
- A geometric approach to the price of anarchy in nonatomic congestion games
- On some non-linear elliptic differential functional equations
- A class of games possessing pure-strategy Nash equilibria
- A survey on networking games in telecommunications
- Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks
- Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions
- Stochastic Motion Planning and Applications to Traffic
- Stochastic Selfish Routing
- How bad is selfish routing?
- Multiple Equilibrium Behaviors on Networks
- Stochastic shortest paths with recourse
- An algorithm for the equilibrium assignment problem with random link times
- Equilibria on a Congested Transportation Network
- An Analysis of Stochastic Shortest Path Problems
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- A dual scheme for traffic assignment problems
- Algorithms, games, and the internet
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Traffic assignment problem for a general network
- Selfish Routing in Capacitated Networks
- The price of anarchy is independent of the network topology
- Stochastic finance. An introduction in discrete time
- Potential games with continuous player sets
This page was built for publication: A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
