A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
The computation of dynamic cournot-nash traffic network equilibria in discrete time
The competition among a finite number of firms who must transport the fixed volume of traffic over a prescribed planning horizon is considered on a congested transportation network with one origin-destination pair connected by parallel routes. It is assumed that each firm attempts to minimize individual transportation cost by making a sequence of simultaneous decisions of departure time, route, and departure flow rate based on the trade-off between arc traversal time and schedule delay penalty. The model is formulated as anN-person nonzero-sum discrete-time dynamic game. A Cournot-Nash network equilibrium is defined under the open-loop information structure. Optimality conditions are derived using the Kuhn-Tucker theorem and given economic interpretation as a dynamic game theoretic generalization of Wardrop’s second principle which requires equilibration of certain marginal costs. A computational algorithm based on the augmented Lagrangian method and the gradient method is proposed and a numerical example is provided. Future extensions of the model and the algorithm are also discussed.
The computation of dynamic cournot-nash traffic network equilibria in discrete time
The competition among a finite number of firms who must transport the fixed volume of traffic over a prescribed planning horizon is considered on a congested transportation network with one origin-destination pair connected by parallel routes. It is assumed that each firm attempts to minimize individual transportation cost by making a sequence of simultaneous decisions of departure time, route, and departure flow rate based on the trade-off between arc traversal time and schedule delay penalty. The model is formulated as anN-person nonzero-sum discrete-time dynamic game. A Cournot-Nash network equilibrium is defined under the open-loop information structure. Optimality conditions are derived using the Kuhn-Tucker theorem and given economic interpretation as a dynamic game theoretic generalization of Wardrop’s second principle which requires equilibration of certain marginal costs. A computational algorithm based on the augmented Lagrangian method and the gradient method is proposed and a numerical example is provided. Future extensions of the model and the algorithm are also discussed.
The computation of dynamic cournot-nash traffic network equilibria in discrete time
KSCE J Civ Eng
Wie, Byung-Wook (author) / Choi, Keechoo (author)
KSCE Journal of Civil Engineering ; 4 ; 239-248
2000-12-01
10 pages
Article (Journal)
Electronic Resource
English
Network facility-location models in Stackelberg-Nash-Cournot spatial competition
| Online Contents | 1992
Dispersion equilibria in spatial Cournot competition
| Online Contents | 2014
Dispersion equilibria in spatial Cournot competition
| Online Contents | 2014
| British Library Online Contents | 2011