Efficiency and vulnerability analysis for congested networks with random data
From MaRDI portal
In this paper, the theory of vulnerability and efficiency of a congested network and the theory of stochastic variational inequalities are combined. As a result, a model is proposed that describes the performance and vulnerability of a congested network with random traffic demands and where the travel time can be affected by uncertainty. As an application, the famous Braess' network is investigated in detail.
Recommendations
- A performance measure analysis for traffic networks with random data and general monotone cost functions
- Assessing the demand vulnerability of equilibrium traffic networks via network aggregation
- The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
- Attacker–defender models and road network vulnerability
- Models and methods for solving the problem of network vulnerability
Cites work
- A network efficiency measure with application to critical infrastructure networks
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Convex expected residual models for stochastic affine variational inequality problems and its application to the traffic equilibrium problem
- Existence of Nash equilibrium for chance-constrained games
- Harmony in the small-world
- How the science of complex networks can help developing strategies against terrorism
- Improved noniterative algorithm for solving the traffic equilibrium problem
- On a Class of Random Variational Inequalities on Random Sets
- On existence theorems for monotone and nonmonotone variational inequalities
- On the convergence of descent methods for monotone variational inequalities
- Random equilibrium problems on networks
- Random variational inequalities and the random traffic equilibrium problem
- Regularization of stochastic variational inequalities and a comparison of an \(L_p\) and a sample-path approach
- Robust solution of monotone stochastic linear complementarity problems
- Some equilibrium problems under uncertainty and random variational inequalities
- Über ein Paradoxon aus der Verkehrsplanung
Cited in
(13)- Analysis of the random flow generated by the feedback transport protocol in a data transfer network
- On the approximation of monotone variational inequalities in \(L^P\) spaces with probability measure
- Optimal road maintenance investment in traffic networks with random demands
- Optimal improvement of communication network congestion via nonlinear programming with generalized Nash equilibrium constraints
- Congestion control and optimal maintenance of communication networks with stochastic cost functions: a variational formulation
- Assessing the demand vulnerability of equilibrium traffic networks via network aggregation
- A performance measure analysis for traffic networks with random data and general monotone cost functions
- Union of random minkowski sums and network vulnerability analysis
- Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
- Attacker–defender models and road network vulnerability
- Network efficiency and vulnerability analysis using the flow‐weighted efficiency measure
- A continuity result for the Nash equilibrium of a class of network games
- A unified variational framework for global agricultural supply chains under uncertain exchange rates: new classes of cost and price functions
This page was built for publication: Efficiency and vulnerability analysis for congested networks with random data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725887)
