Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
From MaRDI portal
(Redirected from Publication:298924)
Recommendations
- On the relationship between dynamic Nash and instantaneous user equilibria
- On the relationship between Nash—Cournot and Wardrop equilibria
- A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium
- Network flow assignment as a fixed point problem
- A differential game approach to the dynamic mixed behavior traffic network equilibrium problem
Cites work
- scientific article; zbMATH DE number 6469241 (Why is no real title available?)
- A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium
- Aggregation and equilibrium with multinomial logit models
- Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing
- Equilibria on a Congested Transportation Network
- Equilibrium points of nonatomic games
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Evolutionarily stable strategies and game dynamics
- Evolutionary game dynamics
- Fixed point theory and applications
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
- Handbooks in operations Research \& management science: Transportation
- Network economics: a variational inequality approach
- Non-cooperative games
- On the convergence of descent methods for monotone variational inequalities
- On the relationship between Nash—Cournot and Wardrop equilibria
- Potential games with continuous player sets
- Projected dynamical systems and variational inequalities with applications
- Queue spillovers in transportation networks with a route choice
- Social optimality and cooperation in nonatomic congestion games.
- The complexity of computing a Nash equilibrium
- The general multimodal network equilibrium problem with elastic demand
- Traffic assignment problem for a general network
Cited in
(5)- Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review
- Day-to-day assignment models and traffic dynamics under information provision
- On the relationship between dynamic Nash and instantaneous user equilibria
- Efficient data reporting in intelligent transportation systems
- Congestion control for a system with parallel stations and homogeneous customers using priority passes
This page was built for publication: Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298924)
