Sensitivity analysis for the asymmetric network equilibrium problem
The authors considered the asymmetric continuous traffic equilibrium network model with fixed demands. The travel cost on each link depends on the flow on this link as well as on other links of the network. A stability and sensitivity analysis is done for this problem. If the travel cost functions are monotone it is shown that the traffic equilibrium pattern depends continuously on the assigned travel demands and travel cost functions. The problem of predicting the direction of the change in the traffic pattern is also studied.
- Applications of sensitivity analysis for probit stochastic network equilibrium
- Sensitivity Analysis for Equilibrium Network Flow
- scientific article; zbMATH DE number 792651
- Sensitivity Analysis for Stochastic User Equilibrium Network Flows—A Dual Approach
- Sensitivity analysis for stochastic user equilibrium network flows with elastic demand
- Sensitivity analysis for abstract equilibrium problems
- Sensitivity analysis of user equilibrium flows revisited
- Sensitivity analysis for set-valued equilibrium problems
- Sensitivity analysis for a Cournot equilibrium
- A new methodology for sensitivity and stability analysis of analytic network models
- An iterative scheme for variational inequalities
- Computational experience with the Chow-Yorke algorithm
- Iterative methods for variational and complementarity problems
- On some non-linear elliptic differential functional equations
- Projection methods for variational inequalities with application to the traffic assignment problem
- The Braess paradox
- Über ein Paradoxon aus der Verkehrsplanung
- Perturbed solutions of variational inequality problems over polyhedral sets
- Sensitivity analysis of generalized variational inequalities
- Approximation theory for stochastic variational and Ky Fan inequalities in finite dimensions
- Partionable variational inequalities with applications to network and economic equilibria
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- On the stability of projected dynamical systems
- Sensitivity analysis for queuing equilibrium network flow and its application to traffic control
- Lead-time quotations in unobservable make-to-order systems with strategic customers: risk aversion, load control and profit maximization
- Nonatomic aggregative games with infinitely many types
- Sensitivity of wardrop equilibria: revisited
- Sensitivity analysis for variational inequalities and nonlinear complementarity problems
- Achieving target equilibria in network routing games without knowing the latency functions
- The classical Braess paradox problem revisited: a generalized inverse method on non-unique path flow cases
- A globally convergent algorithm for transportation continuous network design problem
- A network equilibrium framework for internet advertising: models, qualitative analysis, and algorithms
- How much can taxes help selfish routing?
- A heuristic for the OD matrix adjustment problem in a congested transport network
- scientific article; zbMATH DE number 4035541 (Why is no real title available?)
- Sensitivity Analysis for Equilibrium Network Flow
- The Equilibrium Worth of a Network Link
- Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation
- Variational inequalities applied to the study of paradoxes in equilibrium problems frl:†$f:†This work was supported by MURST and CNR $ef:
- Sensitivity analysis for transit network with distance effect
- Sensitivity of Wardrop Equilibria
- An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria
- A synergetic reformulation of general equilibrium theory
- Using fuzzy integral for evaluating subjectively perceived travel costs in a traffic assignment model
- The price of anarchy in routing games as a function of the demand
- Truthful mechanisms for selfish routing and two-parameter agents
- The model RAS and its sensitivity analysis
- Solution differentiability for oligopolistic network equilibria
- Benders decomposition for variational inequalities
- A network formulation of market equilibrium problems and variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm
- Approximation of the steepest descent direction for the O-D matrix adjustment problem
- A survey of dynamic network flows
- Sensitivity of Wardrop equilibria
This page was built for publication: Sensitivity analysis for the asymmetric network equilibrium problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320098)