Second-best congestion pricing in general static transportation networks with elastic demands

被引:86
作者
Verhoef, ET [1 ]
机构
[1] Free Univ Amsterdam, Dept Spatial Econ, NL-1081 HV Amsterdam, Netherlands
关键词
congestion; road pricing; networks; second-best;
D O I
10.1016/S0166-0462(00)00064-8
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper studies the second-best problem where not all links of a congested transportation network can be tolled. The second-best tax rule for this problem is derived for general static networks, so that the solution presented is valid for any graph of the network and any set of tolling points available. A number of known second-best tax rules are shown to be special cases of the general solution presented. It is further demonstrated that, for instance by using the concept of `virtual links', the same method can be applied to a broader class of second-best problems in static networks. Finally, a small network is used to demonstrate numerically that an interior second-best optimum need not always be unique, and need not always exist. However, both examples require extreme differences in marginal external costs across links, and a non-optimal toll-point to be used, which casts doubt on the practical relevance of this complication. (C) 2002 Elsevier Science B V All rights reserved.
引用
收藏
页码:281 / 310
页数:30
相关论文
共 27 条
[21]   Information provision, flat and fine congestion tolling and the efficiency of road usage [J].
Verhoef, ET ;
Emmerink, RHM ;
Nijkamp, P ;
Rietveld, P .
REGIONAL SCIENCE AND URBAN ECONOMICS, 1996, 26 (05) :505-529
[22]   Time, speeds, flows and densities in static models of road traffic congestion and congestion pricing [J].
Verhoef, ET .
REGIONAL SCIENCE AND URBAN ECONOMICS, 1999, 29 (03) :341-369
[23]  
VERHOEF ET, 1999, 990663 TINB I
[24]  
VICKREY WS, 1969, AM ECON REV, V59, P251
[25]  
Wardrop J. G., 1952, P I CIVIL ENG, V1, P325
[26]  
WILSON JD, 1983, J URBAN ECON, V13, P337, DOI 10.1016/0094-1190(83)90038-4
[27]  
Yang H, 1996, TRANSPORT RES A-POL, V30, P319, DOI 10.1016/0965-8564(96)00003-1