Sensitivity analysis for the asymmetric network equilibrium problem

DOI10.1007/BF02612357zbMath0535.90038WikidataQ96323494 ScholiaQ96323494MaRDI QIDQ3320098

Stella Dafermos, Anna Nagurney

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

predictionsensitivitystabilityvariational inequalityBraess paradoxfixed demandsasymmetric continuous traffic equilibrium network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (33)

The classical Braess paradox problem revisited: a generalized inverse method on non-unique path flow cases ⋮ A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm ⋮ Perturbed solutions of variational inequality problems over polyhedral sets ⋮ A heuristic for the OD matrix adjustment problem in a congested transport network ⋮ Nonatomic aggregative games with infinitely many types ⋮ On the stability of projected dynamical systems ⋮ Sensitivity analysis for queuing equilibrium network flow and its application to traffic control ⋮ Approximation of the steepest descent direction for the O-D matrix adjustment problem ⋮ Sensitivity of wardrop equilibria: revisited ⋮ 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: ⋮ The price of anarchy in routing games as a function of the demand ⋮ A survey of dynamic network flows ⋮ Truthful mechanisms for selfish routing and two-parameter agents ⋮ Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. ⋮ A globally convergent algorithm for transportation continuous network design problem ⋮ A network equilibrium framework for internet advertising: models, qualitative analysis, and algorithms ⋮ Sensitivity analysis of generalized variational inequalities ⋮ An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria ⋮ Using fuzzy integral for evaluating subjectively perceived travel costs in a traffic assignment model ⋮ How much can taxes help selfish routing? ⋮ Sensitivity of Wardrop equilibria ⋮ Sensitivity analysis for variational inequalities and nonlinear complementarity problems ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Lead-time quotations in unobservable make-to-order systems with strategic customers: risk aversion, load control and profit maximization ⋮ Sensitivity of Wardrop Equilibria ⋮ Solution differentiability for oligopolistic network equilibria ⋮ Benders decomposition for variational inequalities ⋮ A network formulation of market equilibrium problems and variational inequalities ⋮ Approximation theory for stochastic variational and Ky Fan inequalities in finite dimensions ⋮ A Synergetic Reformulation of General Equilibrium Theory ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ Partionable variational inequalities with applications to network and economic equilibria

Uses Software

• SATURN

Cites Work

• On some non-linear elliptic differential functional equations
• Computational experience with the Chow—Yorke algorithm
• The Braess paradox
• Projection methods for variational inequalities with application to the traffic assignment problem
• Iterative methods for variational and complementarity problems
• An iterative scheme for variational inequalities
• Über ein Paradoxon aus der Verkehrsplanung

This page was built for publication: Sensitivity analysis for the asymmetric network equilibrium problem