Risk-averse selfish routing
From MaRDI portal
Publication:5219707
Recommendations
Cites work
- A geometric approach to the price of anarchy in nonatomic congestion games
- A mean-risk model for the traffic assignment problem with stochastic travel times
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- A survey on networking games in telecommunications
- Additive consistency of risk measures and its application to risk-averse routing in networks
- Algorithmic Game Theory
- Algorithms, games, and the internet
- Approximation algorithms for reliable stochastic combinatorial optimization
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Cost-balancing tolls for atomic network congestion games
- Efficiency of restricted tolls in non-atomic network routing games
- Efficient graph topologies in network routing games
- Equilibrium routing under uncertainty
- How bad is selfish routing?
- How much can taxes help selfish routing?
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Improving selfish routing for risk-averse players
- Internalization of social cost in congestion games
- Local smoothness and the price of anarchy in splittable congestion games
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Risk-averse stochastic optimization: probabilistically-constrained models and algorithms for black-box distributions (extended abstract)
- Selfish Routing in Capacitated Networks
- Stackelberg strategies and collusion in network games with splittable flow
- Stochastic congestion games with risk-averse players
- Stochastic selfish routing
- Stochastic Shortest Paths Via Quasi-convex Maximization
- The framing of decisions and the psychology of choice
- The impact of worst-case deviations in non-atomic network routing games
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- The price of anarchy is independent of the network topology
- The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
- When the players are not expectation maximizers
- Worst-case equilibria
Cited in
(17)- The impact of worst-case deviations in non-atomic network routing games
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Improving selfish routing for risk-averse players
- Selfish routing with incomplete information
- The impact of worst-case deviations in non-atomic network routing games
- Risk-averse shortest path interdiction
- Additive consistency of risk measures and its application to risk-averse routing in networks
- Stochastic congestion games with risk-averse players
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Stochastic selfish routing
- Improving selfish routing for risk-averse players
- Routing selfish unsplittable traffic
- The theory and application of nondeterministic selfish routing model
- Subjective vs. Objective Reality — The Risk of Running Late
- Price of anarchy for parallel link networks with generalized mean objective
- The price of anarchy for a berth allocation game
- Risk-adaptive approaches to stochastic optimization: a survey
This page was built for publication: Risk-averse selfish routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219707)
