Pareto-Improving Congestion Pricing on General Transportation Networks

Similar documents
Social Network Games

Pareto-improving Congestion Pricing on Multimodal Transportation Networks

Speed-based toll design for cordon-based congestion pricing scheme

Network Equilibrium Models: Varied and Ambitious

Game Theory: introduction and applications to computer networks

Game Theory: Spring 2017

Departure time choice equilibrium problem with partial implementation of congestion pricing

Outline. 3. Implementation. 1. Introduction. 2. Algorithm

Using Piecewise-Constant Congestion Taxing Policy in Repeated Routing Games

MS&E 246: Lecture 18 Network routing. Ramesh Johari

MS&E 246: Lecture 17 Network routing. Ramesh Johari

AGlimpseofAGT: Selfish Routing

Strategic Games: Social Optima and Nash Equilibria

Real-Time Congestion Pricing Strategies for Toll Facilities

Econ 201: Problem Set 3 Answers

Lecture 19: Common property resources

Dynamic Pricing, Managed Lanes and Integrated Corridor Management: Challenges for Advanced Network Modeling Methodologies

Surge Pricing and Labor Supply in the Ride- Sourcing Market

Long run input use-input price relations and the cost function Hessian. Ian Steedman Manchester Metropolitan University

User Equilibrium CE 392C. September 1, User Equilibrium

1. Suppose preferences are represented by the Cobb-Douglas utility function, u(x1,x2) = Ax 1 a x 2

C31: Game Theory, Lecture 1

Tradable Permits for System-Optimized Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

Cyber-Physical Cooperative Freight Routing System

The discrete-time second-best day-to-day dynamic pricing scheme

On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users

Traffic Games Econ / CS166b Feb 28, 2012

Potential Games. Krzysztof R. Apt. CWI, Amsterdam, the Netherlands, University of Amsterdam. Potential Games p. 1/3

Industrial Organization Lecture 3: Game Theory

Pareto-improving toll and subsidy scheme on transportation networks

Lagrangian road pricing

RANDOM SIMULATIONS OF BRAESS S PARADOX

Game Theory and Control

Business Cycles: The Classical Approach

Algorithmic Game Theory. Alexander Skopalik

Enhancing Generalization Capability of SVM Classifiers with Feature Weight Adjustment

Supplementary Technical Details and Results

Randomized Smoothing Networks

Elements of Economic Analysis II Lecture VII: Equilibrium in a Competitive Market

On the Smoothed Price of Anarchy of the Traffic Assignment Problem

Allocation of Transportation Resources. Presented by: Anteneh Yohannes

A (Brief) Introduction to Game Theory

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

Iterated Strict Dominance in Pure Strategies

Voting over Selfishly Optimal Income Tax Schedules with Tax-Driven Migrations

Modeling Parking. Authors: Richard Arnott, John Rowse. This work is posted on Boston College University Libraries.

Lecture 4: Labour Economics and Wage-Setting Theory

OD-Matrix Estimation using Stable Dynamic Model

Minimizing and maximizing compressor and turbine work respectively

= Prob( gene i is selected in a typical lab) (1)

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016

Morning Commute with Competing Modes and Distributed Demand: User Equilibrium, System Optimum, and Pricing. Eric J. Gonzales and Carlos F.

OIM 413 Logistics and Transportation Lecture 8: Tolls

Minimizing Price of Anarchy in Resource Allocation Games

Mechanism Design for Network Decongestion: Rebates and Time-of-Day Pricing

Two-Player Kidney Exchange Game

Towards a Theory of Societal Co-Evolution: Individualism versus Collectivism

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

ALGORITHMIC GAME THEORY. Incentive and Computation

Game theory and market power

Returns to Scale in Networks. Marvin Kraus * June Keywords: Networks, congestion, returns to scale, congestion pricing

Mechanism Design: Implementation. Game Theory Course: Jackson, Leyton-Brown & Shoham

Consider this problem. A person s utility function depends on consumption and leisure. Of his market time (the complement to leisure), h t

1 Bertrand duopoly with incomplete information

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 12 Scribe: Indraneel Mukherjee March 12, 2008

Routing Games 1. Sandip Chakraborty. Department of Computer Science and Engineering, INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR.

Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2)

A Generalization of a result of Catlin: 2-factors in line graphs

Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma

Comparison of Small-Area OD Estimation Techniques

Viable and Sustainable Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003

5 Quantum Wells. 1. Use a Multimeter to test the resistance of your laser; Record the resistance for both polarities.

Quantum Games. Quantum Strategies in Classical Games. Presented by Yaniv Carmeli

Introduction to Game Theory

Minimize Cost of Materials

Reducing Congestion Through Information Design

Online Appendix for Sourcing from Suppliers with Financial Constraints and Performance Risk

UC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes

Inducing Peer Pressure to Promote Cooperation (Supporting Information)

A Model of Traffic Congestion, Housing Prices and Compensating Wage Differentials

MATHEMATICAL APPENDIX to THREE REVENUE-SHARING VARIANTS: THEIR SIGNIFICANT PERFORMANCE DIFFERENCES UNDER SYSTEM-PARAMETER UNCERTAINTIES

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

Mathematical Economics - PhD in Economics

A New Recommendation System for Personal Sightseeing Route from Subjective and Objective Evaluation of Tourism Information

On revealed preferences in oligopoly games

CALCULATION OF STEAM AND WATER RELATIVE PERMEABILITIES USING FIELD PRODUCTION DATA, WITH LABORATORY VERIFICATION

On the Energy-Delay Trade-off of a Two-Way Relay Network

Criteria for the determination of a basic Clark s flow time distribution function in network planning

Game Theory for Linguists

Improved Shuffled Frog Leaping Algorithm Based on Quantum Rotation Gates Guo WU 1, Li-guo FANG 1, Jian-jun LI 2 and Fan-shuo MENG 1

ANALYSING THE CAPACITY OF A TRANSPORTATION NETWORK. A GENERAL THEORETICAL APPROACH

Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks

Efficient MCMC Samplers for Network Tomography

Complementarity Models for Traffic Equilibrium with Ridesharing

Using Reputation in Repeated Selfish Routing with Incomplete Information

Static (or Simultaneous- Move) Games of Complete Information

Publication List PAPERS IN REFEREED JOURNALS. Submitted for publication

Computing Solution Concepts of Normal-Form Games. Song Chong EE, KAIST

On Buffer Limited Congestion Window Dynamics and Packet Loss

Topic 2: Algorithms. Professor Anna Nagurney

Transcription:

Transportation Seminar at University of South Florida, 02/06/2009 Pareto-Improving Congestion Pricing on General Transportation Netorks Yafeng Yin Transportation Research Center Department of Civil and Coastal Engineering University of Florida Joint ork ith Toi Laphongpanich, Ziqi Song and Di Wu 1

Congestion Pricing The basic concept has been around for over 80 years (e.g., Pigou, 1920 and Knight, 1924) Internalize the negative externality of a trip by charging up to the full cost that the trip imposes to the society Use tolls to provide incentives for users to change their travel behaviors to reduce traffic congestion, enhance system performance and improve social benefits 2

Congestion Pricing Practice Cordon Pricing Singapore, Oslo, London and Stockholm etc High-Occupancy/Toll Lanes I-15 in California I-394 in Minnesota I-95 in Florida Others U.S. Congress established Value Pricing Pilot Program The UK government has plans to introduce trial road-pricing schemes across England 3

Source:.stockholmsforsoket.se, the official ebpage for The Stockholm Congestion Pricing Trial 4

Public Acceptance Tolling is unappealing to the public http://petitions.number10.gov.uk/traveltax/ Despite the success of the Stockholm Congestion Charging Trial in 2006, the results from the referendum are unclear Stockholm: 53% For and 47% Against 14 surrounding municipalities: 39.8% For and 60.2% Against. The possible loss of elfare associated ith, e.g., having to sitch to less desirable routes, departure times or transportation modes because the more desirable ones are no longer affordable 5

Pareto-Improving Pricing Approach When compared to the situation ithout any pricing intervention, Pareto-improving tolls increase the social benefit ithout increasing travel-related expense of every stakeholder that may include individual road users, transit passengers, transit operators, transportation authorities, etc. Our premise: Pareto-improving schemes are more appealing to the public. Neither rationing (e.g., Daganzo, 1995) nor revenue distribution (e.g., Yang and Guo, 2005) is required to achieve a Pareto improvement. 6

Example Cost function: t ij (v ij ) 3 10v 13 2+25v 34 1 10 + v 32 4 50+ v 12 10v 24 2 t ij (v ij ) = travel time for arc (i, j), here v ij is the flo on the arc There are 3.6 travelers for OD pair (1, 4) 7

Flo Distributions User Equilibrium (UE) Distribution Every user is a utility maximizer No user has any incentive to sitch travel routes Longer system delay System Optimal (SO) Distribution Minimum total travel time or system delay Some users have to use longer routes 8

Example (Cont d) User equilibrium solution ith total delay = 255.82. Send 1.3223 units along path 1 3 4 ith travel time 71.06. Send 2.2772 units along path 1 3 2 4 ith travel time 71.06. Send 0 units along path 1 2 4 ith travel time 72.78. 1.3223 3 36.00 3 35.06 1 4 1 12.28 4 2 2.2772 50.00 2 22.78 User Equilibrium Flos Resulting Travel Times 9

Example (Cont d) System optimal solution ith total delay = 227.11. Send 1.1685 units along 1 3 4 ith travel time 51.85. Send 0.8956 units along 1 3 2 4 ith travel time 55.85 Send 1.5359 units along 1 2 4 ith travel time 75.85 1.1685 3 20.64 3 31.21 1 0.8956 4 1 10.89 4 1.5359 2 51.53 2 24.32 System Optimal Flos Resulting Travel Times 10

Marginal Cost Pricing Set the toll on arc (i, j) equal to its marginal external cost at the system optimum v* 3 τ ij t ( v ) v = ij ij ij 10v 13 + 20.641 2+25v 34 + 29.21 1 10 + v 32 + 0.90 4 50+ v 12 + 1.54 10v 24 + 24.32 2 11

Marginal Cost Pricing: Example System optimum is in a tolled user equilibrium Send 1.1685 units along 1 3 4 ith time 51.85 + 49.85 = 101.70 Send 0.8956 units along 1 3 2 4 ith time 55.85 + 45.85 = 101.70 Send 1.5359 units along 1 2 4 ith time 75.85 + 25.85 = 101.70 1.1685 3 20.64 + 20.64 3 31.21 +29.21 1 0.8956 4 1 10.89+0.90 24.32 4+ 24.32 1.5359 2 51.53+1.54 2 Tolled User Equilibrium Flos Resulting Travel Times 12

Marginal Cost Pricing: Comparison Without tolls 3 1.3223, With MC tolls 3 1.1685 1 2.2772 4 1 0.8956 4 2 2 1.5359 Without tolls: Time of 1 3 4 = 71.06. Time of 1 3 2 4 = 71.06. Total Delay = 255.82 With MC tolls: Cost of 1 3 4= 101.70 Cost of 1 3 2 4= 101.70 Cost of 1 2 4= 101.70 Total Delay = 227.11 Toll Revenue = 139.02 13

Marginal Cost Pricing Marginal cost and other first-best pricing schemes are most likely doomed to be political failures because users ill find themselves orse off (Hau, 2005). 14

Pareto-Improving Tolls Consider the folloing set of tolls 3 10v 2+25v 13 34 + 0.31 1 10 + v 32 + 18.51 4 50+ v 12 10v 24 2 15

Pareto-Improving Tolls (Cont d) Resulting Flo Distribution has a total delay of 241.17 Send 1.79 units along 1 3 4 ith time 69.15+0.31 = 69.46 Send 0.45 units along 1 3 2 4 ith time 50.95+18.51 = 69.46. Send 1.36 units along 1 2 4 ith time 69.46 1.79 3 22.40 3 46.75 + 0.31 1 0.45 4 1 10.45 +18.51 4 1.36 2 51.36 2 18.10 Dominating Flo Dist. Resulting Travel Times 16

Pareto-Improving Tolls: Comparison Without tolls 3 1.3223, With PI tolls 1.79 3 1 2.2772 4 1 0.45 4 2 1.36 2 Without tolls: Time of 1 3 4 = 71.06. Time of 1 3 2 4 = 71.06. Total Delay = 255.82 With PI tolls: Cost of 1 3 4= 69.46 Cost of 1 3 2 4= 69.46 Cost of 1 2 4= 69.46 Total Delay = 241.17 Revenue = 8.88 17

Pareto-Improving Tolls Why is it possible? Is it alays possible? If not, ho do e kno hen it is? Ho do e find the tolls? 18

More on User Equilibrium User equilibrium is essentially a Nash equilibrium in Game Theory Game theory is concerned ith the general analysis of strategic interactions among multiple players Nash equilibrium in simultaneous non-cooperative games Each player s choice is optimal given others choice No player ould find it in his or her interest to deviate unilaterally from a Nash equilibrium strategy 19

Prisoner s Dilemma Nash equilibrium does not necessarily lead to Pareto efficiency. Confess Play B Deny Confess -3, -3 0, -6 Play A Deny -6, 0-1, -1 20

Dominating Flo Distribution Link Flos Link UE DF-F-1 DF-F-2 DF-F-3 (1, 3) 3.60 1.90 2.24 2.24 (1, 2) 0.00 1.70 1.36 1.36 (3, 2) 2.28 0 0.45 0.61 (3, 4) 1.32 1.90 1.79 1.63 (2, 5) 2.28 1.70 1.81 1.97 Cost of the Longest Utilized Path. 71.06 68.7 69.4 71.06 System Cost or Total Delay 255.78 247.1 241.17 234.99 SO 2.06 1.54 1.53 1.17 2.43 75.85 227.11 Minimum Delay = 227.11 21

Pareto-Improving Tolls UE Pareto-Improving Link Flo Time Flo-3 Time Toll: PI-3 Gen Cost (1, 3) 3.6000 36.00 2.2397 22.40 0 22.40 (1, 2) 0.0000 50.00 1.3603 51.36 0 51.36 (3, 2) 2.2778 12.28 0.6092 10.61 18.35 28.96 (3, 4) 1.3222 35.06 1.6305 42.76 5.89 48.66 (2, 4) 2.2778 22.78 1.9695 19.69 0 19.69 Path 1-3-4 1.3222 71.06 1.6305 65.16 5.89 71.06 1-3-2-4 2.2778 71.06 0.6092 52.70 18.35 71.06 1-2-4 0.0000 72.78 1.3603 71.06 0.00 71.06 Total demand 3.6000 3.6000 Cost to users 255.80 235.01 20.79 255.80 Toll Revenue 0 20.79 Total Delay 255.78 234.99 22

Summary Why is it possible? User equilibrium may not be Pareto efficient and dominated by another flo distribution A pricing scheme may be developed to evolve the system to the dominating flo distribution Is it alays possible? No Ho do e kno hether it is possible and ho to design a Pareto-improving pricing scheme? 23

24 Pareto-Improving Toll (PIT) Problem a τ c P r v t P r v t f V v s t v v t a UE a a a a ar a a a a ar r F T + = + 0,,, ) ) ( (, 0, ) ) ) ( ( (.. ) ( min λ λ τ δ λ τ δ = = = r P r r P r r ar a F f d f f v v V 0}, ; : { δ

Properties of the PIT Problem If (v*,τ*) solves the PIT problem and t(v*) T v* < t(v UE ) T v UE, then τ* is a vector of Pareto-improving tolls. If t(v*) T v* = t(v UE ) T v UE, then no Paretoimproving toll exists. The PIT problem belongs to a class of optimization problems difficult to solve (mathematical programs ith complementarity constraints) It violates a standard regularity condition. Commercial softare of nonlinear optimization problems are ineffective. 25

Our Solution Approach Solve a sequence of relaxed nonlinear optimization problems Commercial softare Use concepts from manifold suboptimization to improve the relaxation. Our algorithm Stops after a finite number of iterations. Produce a strongly regular solution. Local optimal solutions are strongly regular. 26

Extension: PIT-Elastic Demand min t( v) T v s.t. v = x 0 d D 1 ( z) dz Ax E d = 0,, t ( ) + β ( ρ ρ ), and ( i, j) L, ij v ij x ij ij i j ( t ( v ) + β ( ρ ρ )) = 0,, and ( i, j) L, ij ij ij i 1 ρ ρ D ( d ),, o( ) d ( ) 1 ( d) cue j D x 0, β 0, and ( i, j) L, ij ij 27

Extension: PIT-Heterogeneous Users k MCPI-P: min β tu ( ) s.t. v V T ( δ ( β τ ) λ ) f t ( u ) + = 0, k,and r P k, k k, r a ar a a a k λ a k, τ 0 F k ( ) δ β τ λ k, k ar ta ( ua ) + a, k,and r Pk c UE k, v k, k 28

Extension: Approximate PIT Pareto-improving tolls may not exist or lead to a significant reduction in congestion. Tolls are approximately Pareto-improving if Users are slightly orse-off Congestion decreases 29

30 Extension: Approximate PIT here 0 < α < 0.1 ( ) a τ c P r v t P r v t f V v s t v v t a UE a a a a ar a a a a ar r F T + + = + 0,, 1, ) ) ( (, 0, ) ) ) ( ( (.. ) ( min α λ λ τ δ λ τ δ

Numerical Results Netorks Nine Node: 18 links, 9 nodes, 4 O-D pairs Sioux Falls: 76 links, 24 nodes, 528 O-D pairs Hull: 798 links, 501 nodes, 158 O-D pairs Fixed Demands BPR Travel Time Functions 31

Netorks 1 2 3 2 5 4 14 6 9 12 3 4 5 6 8 11 15 13 16 19 23 7 35 10 31 21 17 9 8 7 24 20 25 26 22 47 18 33 27 29 50 12 11 10 16 18 36 32 48 30 49 52 55 51 34 40 28 43 17 54 Nine-node Netork 37 38 53 58 41 45 14 15 19 44 57 42 71 46 67 56 60 70 59 61 23 22 72 63 73 76 65 69 68 39 66 62 13 24 21 20 74 75 64 Sioux Falls 32

Results Nine-Node Sioux Falls Hull System Optimal Travel Delay (min.) 2253.92 3514.39 50542.64 User Equilibrium Travel Delay (min.) 2455.87 3654.46 51350.74 Dominating flo induced by exact PIT tolls Travel Delay (min.) 2455.28 3654.30 51337.33 Reduction (% of max.) 0.29% 0.12% 1.66% Dominating flo induced by approximate PIT tolls ith α = 0.05 Travel Delay (min) 2361.16 3620.00 51146.68 Reduction (% of max.) 46.90% 24.63% 25.25% Dominating flo induced by approximate PIT tolls ith α = 0.10 Travel Delay (min.) 2361.16 3619.32 51086.23 Reduction (% of max.) 46.90% 25.09% 32.73% 33

Increase of O-D Travel Time (Sioux Falls) Gini =0.0541 SO UE c c Gini =0.0176 API UE c c 34

Observations Pareto-improving tolls are relatively prevalent. Hoever, as second-best pricing schemes, they may not lead to a significant improvement in the system performance. When Pareto-improving tolls do not exist or achieve the desired improvement, the approximate version may be able to do so ithout making users severely orse off as in the case ith marginal cost pricing. 35

Multimodal Transportation Netorks To further generalize the theory and achieve higher levels of improvement through the synergy among different modes, e further consider multimodal transportation netorks that includes: Transit services High-occupancy/toll (HOT) General-purpose or regular lanes 36

Pareto-Improving Tolls In this setting, a pricing scheme refers to a strategy for tolling roads and highays as ell as adjusting fares on various transit lines. A Pareto improvement may be achieved through better distributing travel demands among the available modes of transportation revenue cross-subsidizing beteen transit and vehicle users 37

Pareto-Improving Tolls Problem max 1 ln exp( θ( ρ ρ ) β ) D τ st..,,, Ax m = E m d m, W, m M, m, m, m m, m j i l l θ m m l W x c, l L, T, T T l l x fω, i N, l L, W, T, + l l i i m M m, l m, d = D W,, x 0, l L, W, m M, x = 0, l L L, W, T, S H l m, l { } T x = 0, l L, W, m S, H. x 38

Pareto-Improving Tolls Problem (Cont d) ( x) ( t + τ ( ρ ρ )) x m, m, m, m l l j i l = 0,,,, ( ( ) τ μ γ ρ ρ ) xl S H { }, W, { } + l L L m S, H, l L, l L, T T T T T + t x + + + ( ) = 0, l L, W, l L, l L, l l l l j i i j i j 1 (ln m, m ) m, m, 0,,, θ + i l L γ d + β + λ E ρ = W m M f μ = 1, i I, W, l l T, T T l( xl cl ) = 0, l L, W μ =, ( T ) 0, T l xl flωi l L, W, m, m, m ( ) τ ρ ρ, l L,, { } + t x + ( ) 0 W m S, H, l L, l L, l l j i i j ( ) t x l L W l L l L T T, T, + l + τl + μl + γl ( ρj ρi ) 0,,, i, j, T γ 0, l L, l T μ 0, l L, W, l 39

Pareto-Improving Tolls Problem (Cont d) τ τ τ τ τ = τ, l L, H S S l l S l T = 0, l L, { } { } = 0, l L L, H H T l = 0, l L L, T S H l H l S, τ 0, l L, l E ρ t, W, m M, m, m, m, UE m l m τ x 0, W, m M, l L. l, m l 40

Numerical Example (5, 12) 1 5 (5, 12) (6, 18) (3, 35) (9, 20) (9, 35) 2 6 (9, 12) (2, 11) (3, 25) 7 (2, 11) (3, 12) (8, 26) (4, 26) (4, 11) 9 (7, 32) (8, 30) (6, 33) (6, 11) (2, 19) (4, 36) 8 (6, 43) (6, 11) Regular link HOT link 1-3: 30 1-4: 30 O-D demand: 2-3: 30 2-4: 40 3 (8, 39) (6, 24) 4 Nine-node Netork 41

Results SO UE Pareto-improving Social benefits -1875.90-2603.27-2068.95 System travel time 1994.13 2851.63 2241.59 Revenue 513.97 0.00 70.22 Demand Travel cost Travel cost increase (%) SOV HOV Transit SOV HOV Transit SOV HOV Transit 1-3 7.79 13.56 8.65 20.80 7.65 1.55 10.97 12.60 6.42 1-4 14.67 11.56 3.77 21.51 7.91 0.58 16.38 7.30 6.32 2-3 10.95 17.85 1.20 21.49 7.91 0.61 13.29 15.26 1.44 2-4 16.58 21.59 1.83 27.74 10.20 2.06 16.85 19.35 3.80 1-3 24.59 16.82 14.07 22.40 22.40 25.40 21.22 15.53 13.90 1-4 23.22 19.41 20.02 22.22 22.22 30.27 19.90 18.94 14.66 2-3 21.91 14.47 22.95 20.34 20.34 28.19 18.65 12.96 19.75 2-4 23.38 17.06 24.40 22.07 22.07 25.07 22.07 16.37 19.52 1-3 9.8-24.9-44.6 - - - -5.3-30.7-45.3 1-4 4.5-12.6-33.9 - - - -10.4-14.8-51.6 2-3 7.7-28.9-18.6 - - - -8.3-36.3-29.9 2-4 5.9-22.7-2.7 - - - 0.0-25.8-22.1 42

Tolls Toll SO Pareto-improving SOV HOV Transit SOV HOV Transit 1-5 1.71 0.68 0.00 0.72 0.72-4.71 1-6 2.39 0.96 0.00 0.00 0.00-1.74 2-5 1.15 0.46 0.00 0.00 0.00-0.77 2-6 0.12 0.05 0.00 0.00 0.00 0.00 5-6 0.00 0.00 0.00 0.00 0.00-3.25 5-7 9.84 3.94 0.00 7.92 7.92 6.54 5-9* 0.50 0.20 0.00 0.00 0.00 0.00 6-5 0.00 0.00 0.00 0.00 0.00-1.30 6-8 1.28 0.51 0.00 0.39 0.39 2.37 6-9* 0.00 0.00 0.00 0.00 0.00-2.29 7-3 1.41 0.56 0.00 0.00 0.00-3.52 7-4 0.84 0.34 0.00 0.79 0.79-0.76 7-8 0.00 0.00 0.00 0.00 0.00-0.64 8-3 0.00 0.00 0.00 0.69 0.69-11.40 8-4 0.50 0.20 0.00 0.00 0.00-7.20 8-7 0.00 0.00 0.00 0.13 0.13-6.36 9-7* 0.25 0.10 0.00 0.00 0.00-1.44 9-8* 0.00 0.00 0.00 0.00 0.00-2.05 1-5* 2.07 0.83 0.00 0.00 0.00-5.42 2-6* 0.12 0.05 0.00 0.00 0.00-0.06 5-7* 10.56 4.22 0.00 5.69 0.00 4.31 6-8* 1.31 0.52 0.00 0.78 0.00 3.18 7-3* 1.74 0.70 0.00 1.60 0.00-3.52 8-4* 0.55 0.22 0.00 0.18 0.00-7.71 43

Concluding Remarks Pareto-improving tolls A ne class of second-best tolls These tolls increase the social benefit ithout making any user orse off hen compared to the situation ithout any pricing intervention. Additionally, the Pareto-improving charging scheme requires neither rationing nor revenue distribution, but relies on a fact that the original Wardropian user equilibrium flo distribution may not be Pareto efficient. Pareto-improving tolls are relatively prevalent. Hoever, the tolls may not lead to a significant improvement in the system performance. 44

Concluding Remarks (Cont d) Pareto improvement can be further enhanced on multimodal transportation netorks by better distributing travel demands among the available modes of transportation and revenue crosssubsidizing beteen transit and vehicle users The Pareto-improving toll problems can be formulated as mathematical programs ith complementarity constraints, hich can be solved effectively using a manifold suboptimization technique. 45

Acknoledgement This research is support in parts by grants from the National Science Foundation (CMMI-0653804) and the Center of Multimodal Solutions for Congestion Mitigation, University of Florida. 46