Back to Search
Start Over
PRICING GEOMETRIC TRANSPORTATION NETWORKS.
- Source :
- International Journal of Computational Geometry & Applications; Dec2009, Vol. 19 Issue 6, p507-520, 14p, 5 Diagrams
- Publication Year :
- 2009
-
Abstract
- We propose algorithms for pricing a transportation network in such a way that the profit generated by the customers is maximized. We model the transportation network as a subset of the plane and take into account the fact that the customers minimize their own transportation cost. The underlying theory is a two-player game model called Stackelberg games. We propose algorithms for the cases where the fare does and does not depend on the distance traveled, in the L<subscript>1</subscript> or L<subscript>2</subscript> metrics. In particular, we propose an O(n log n) algorithm for optimal pricing of a highway under the L<subscript>2</subscript> metric, and an O(nk log n log<superscript>3</superscript> k) algorithm for orthogonally convex networks of complexity O(k) under the L<subscript>1</subscript> metric. [ABSTRACT FROM AUTHOR]
- Subjects :
- TRANSPORTATION research
ALGORITHMS
GEOMETRY
CONSUMERS
PROFIT
PLANE geometry
Subjects
Details
- Language :
- English
- ISSN :
- 02181959
- Volume :
- 19
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- International Journal of Computational Geometry & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 47377914
- Full Text :
- https://doi.org/10.1142/S021819590900309X