Pricing network edges to cross a river

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 140-153

  Grigoriev, Alexander ^a   Van Hoesel, Stan ^a   Van Der Kraaij, Anton F ^a   Uetz, Marc ^a   Bouhtou, Mustapha ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; POLYNOMIAL APPROXIMATION; SET THEORY;

PRICING NETWORKS; STACKELBERG PRICING PROBLEM; TARRIF ARCS; UNIFORM PRICING;

COMPUTATIONAL GEOMETRY;

EID: 23944466002     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31833-0_13     Document Type: Conference Paper

References (14)

1. M. Bouhtou, S. van Hoesel, A. F. van der Kraaij, and J.L. Lutton. Tariff optimization in networks. Meteor Research Memorandum RM03011, Maastricht University, 2003.
2. R. Cole, Y. Dodis, and T. Roughgarden. How much can taxes help selfish routing? In Proceedings of the 4th Annual ACM Conference on Electronic commerce, pages 98-107, 2003.
3. R. Cole, Y. Dodis, and T. Roughgarden. Pricing network edges for heterogeneous selfish users. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 521-530, 2003.
4. S. Dempe. Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization, 52:333-359, 2003.
5. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979.
6. 1-ε. Acta Mathematica, 182:105-142, 1999.
7. R.G. Jeroslow. The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 32:146-164, 1985.
8. R.M. Karp and J. B. Orlin. Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics, 3:37-45, 1981.
9. M. Labbé, P. Marcotte, and G. Savard. A bilevel model of taxation and its application to optimal highway pricing. Management Science, 44:1608-1622, 1998.
10. S. Roch, G. Savard, and P. Marcotte. Design and Analysis of an approximation algorithm for Stackelberg network pricing. Optimization Online, 2003.
11. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the Association for Computing Machinery, 49(2):236-259, 2002.
12. S. van Hoesel, A. F. van der Kraaij, C. Mannino, G. Oriolo, and M. Bouhtou. Polynomial cases of the tarification problem. Meteor Resarch Memorandum RM03053, Maastricht University, 2003.
13. L.N. Vicente and P. H. Calamai. Bilevel and multilevel programming: A bibliography review. Journal of Global Optimization, 5:291-306, 1994.
14. N. E. Young, R. E. Tarjan, and J. B. Orlin. Faster parametric shortest path and minimum-balance algorithms. Networks, 21:205-221, 1991.