Pia Bergendorff, Donald W. Hearn, Motakuri V. Ramana  Home/Search
Context Related
| ufl.edu/~ramana/research/big...tolls.ps starnetinc.com/ramana1/resea...tolls.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ufl.edu/~ramana/research/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This paper concerns tolling methodologies for traffic networks which ensure that the resultant equilibrium flows are system optimal. A nonnegative vector fi is defined to be a valid toll vector, if the set of tolled user equilibrium solutions is a subset of the set of untolled system optimal solutions. The problem of characterizing the toll set T , which is the set of all valid toll vectors, is studied. Descriptions and characterizations of T are given for the cases when either the cost map... (Update)
Context of citations to this paper: More
.... made significant progress in efficiently computing and characterizing taxes that induce a minimum latency routing of traffic [5, 13, 14, 16]. This work considers only the case of homogeneous traffic, but forms the basis of the algorithmic results in this paper. The...
.... science community has long realized that marginal cost taxes may cause users to pay more than is necessary (see e.g. [4, 12]) but has apparently neglected the idea of incorporating the amount of taxes paid into the definition of social welfare. The more general...
Cited by: More
A Survey on Networking Games in Telecommunications - Altman, Boulogne.. (2000) (Correct)
How Much Can Taxes Help Selfish Routing? - Cole, Dodis, Roughgarden (Correct)
A Mathematical Model and Descent Algorithm for Bilevel.. - Patriksson, Rockafellar (2001) (Correct)
Active bibliography (related documents): More All
1.5: Solving Congestion Toll Pricing Models - Hearn, Ramana (1998) (Correct)
0.6: Traffic Congestion and Congestion Pricing - Lindsey, Verhoef (2000) (Correct)
0.3: Network Routing - Kelly (1991) (Correct)
Similar documents based on text: More All
0.4: Why States Toll: An Empirical Model of Finance Choice - Levinson (2001) (Correct)
0.3: Designing The Westerscheldetunnel Toll Plaza Using A.. - van Dijk, Hermans.. (Correct)
0.3: Tolling at a Frontier: A Game Theoretic Analysis - Levinson (1999) (Correct)
Related documents from co-citation: More All
5: The Traffic Assignment Problem: Models and Methods (context) - Patriksson - 1994
5: al games, Games and Economic Behavior (context) - Monderer, Shapley - 1996
4: Some theoretical aspects of road traffic research (context) - Wardrop - 1952
BibTeX entry: (Update)
P. Bergendorff, D. W. Hearn and M. V. Ramana, Congestion Toll Pricing of Traffic Networks, Network Optimization, P. M. Pardalos, D.W. Hearn and W.W. Hager (Eds.), Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Vol. 450, pp. 51-71, 1997. http://citeseer.ist.psu.edu/bergendorff96congestion.html More
@misc{ bergendorff97congestion,
author = "P. Bergendorff and D. Hearn and M. Ramana",
title = "Congestion Toll Pricing of Traffic Networks",
text = "P. Bergendorff, D. W. Hearn and M. V. Ramana, Congestion Toll Pricing of
Traffic Networks, Network Optimization, P. M. Pardalos, D.W. Hearn and W.W.
Hager (Eds.), Lecture Notes in Economics and Mathematical Systems, Springer-Verlag,
Vol. 450, pp. 51-71, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/bergendorff96congestion.html" }
Citations (may not include all citations):307 Interior Point Polynomial Methods for Convex Programming: Th.. (context) - Nesterov, Nemirovskii - 1994
267 The Linear Complementarity Problem (context) - Cottle, Pang et al. - 1992
44 An Algorithmic Analysis of Multiquadratic and Semidefinite P.. (context) - Ramana - 1993
33 The Economics of Welfare (context) - Pigou - 1920
13 The Marginal Cost Taxation of a Transportation Network (context) - Smith - 1979
11 The Gap Function of a Convex Program (context) - Hearn - 1982
10 Bounding Flows in Traffic Assignment Models (context) - Hearn - 1980
7 Some Fallacies in the Interpretation of Social Cost (context) - Knight - 1924
6 A Simple Characterization of Solution Sets of Convex Program.. (context) - Mangasarian - 1988
5 The Bounded Flow Approach to Congestion Pricing (context) - Bergendorff - 1995
5 Toll Patterns for Multiclass-User Transportation Networks (context) - Dafermos - 1973
4 The Economics of Traffic Congestion (context) - Arnott, Small - 1994
3 Bounded Flow Equilibrium by Penalty Methods (context) - Hearn, Ribera - 1980
3 Affectations de Trafic et Tarification au Cout Marginal Soci.. (context) - Netter - 1972
3 The Theory and Measurement of Private and Social Cost of Hig.. (context) - Walters - 1961
2 Handbooks in OR and MS (context) - Florian, Hearn et al. - 1995
1 Transportation Research Vol (context) - Morrison, of et al. - 1986
1 the Solutions of the Positive Semidefinite Complementarity P.. (context) - Adler, Gale - 1975
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www2.ise.ufl.edu/~ramana/research/index.html): More
Continuous Characterizations of the Maximum Clique Problem - Gibbons, Hearn, Pardalos, .. (1997) (Correct)
Motakuri Venkata Ramana - Robert Freund (Correct)
Polyhedra, Spectrahedra, and Semidefinite Programming - Ramana (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC