A mixed traffic assignment problem and its upper bound of efficiency loss
From MaRDI portal
Publication:2336305
DOI10.1155/2014/290972zbMath1437.90043DBLPjournals/jam/YuL14OpenAlexW2041562298WikidataQ59050736 ScholiaQ59050736MaRDI QIDQ2336305
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/290972
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20)
Cites Work
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Bounding the inefficiency of logit-based stochastic user equilibrium
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Bounding the inefficiency of equilibria in nonatomic congestion games
- How bad is selfish routing?
- On the relationship between Nash—Cournot and Wardrop equilibria
- Multiple Equilibrium Behaviors on Networks
- Stackelberg scheduling strategies
- Selfish Routing in Capacitated Networks
This page was built for publication: A mixed traffic assignment problem and its upper bound of efficiency loss
