An approximation algorithm for stackelberg network pricing

Networks

Volumn 46, Issue 1, 2005, Pages 57-67

  Roch, Sébastien ^a   Savard, Gilles ^b   Marcotte, Patrice ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Approximation algorithms; Combinatorial optimization; Network pricing; NP hard problems; Stackelberg games

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; NETWORK PRICING; STACKELBERG GAMES;

AEROSPACE INDUSTRY; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; SET THEORY; TELECOMMUNICATION NETWORKS; THEOREM PROVING; VECTORS;

ALGORITHMS;

EID: 23244451228     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20074     Document Type: Article

References (21)

1. Audet, C., Hansen, P., Jaumard, B., and Savard, G., Links between linear bilevel and mixed 0-1 programming problems, J Optimizat Theory Appl 93 (1997), 273-300.
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M., Complexity and approximation, Springer, Berlin, 1999.
3. Cocchi, R., Shenker, S., Estrin, D., and Zhang, L., Pricing in computer networks: Motivation, formulation and example, IEEE/ACM Trans Networking 1 (1993), 614-627.
4. Garey, M.R. and Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, New York, 1979.
5. Hearn, D.W. and Ramana, M.V., "Solving congestion toll pricing models," Equilibrium and advanced transportation modelling, Marcotte and Nguyen (Editors), Kluwer, New York, 1998, pp. 109-124.
6. Hochbaum, D.S. (Editor), Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, 1997.
7. Jeroslow, R.G., The polynomial hierarchy and a simple model for competitive analysis, Math Program 32 (1985), 146-164.
8. Korilis, Y.A., Lazar, A.A., and Orda, A., Achieving network optima using Stackelberg routing strategies, IEEE/ACM Trans Networking 5 (1997), 161-173.
9. Larsson, T. and Patriksson, M., "Side constrained traffic equilibrium models-Traffic management through link tolls," Equilibrium and advanced transportation modelling, Marcotte, P. and Nguyen, S. (Editors), Kluwer, New York, 1998, pp. 125-151.
10. Labbé, M., Marcotte, P., and Savard, G., A bilevel model of taxation and its application to optimal highway pricing, Manage Sci 44 (1998), 1608-1622.
11. Labbé, M., Marcotte, P., and Savard, G., "On a class of bilevel programs," Nonlinear optimization and related topics, Di Pillo, G. and Giannessi, F. (Editors), Kluwer Academic Publishers, New York, 1999, pp. 183-206.
12. Luo, Z.-Q., Pang, J.-S., and Ralph, D., Mathematical programs with equilibrium constraints, Cambridge University Press, UK, 1996.
13. Marcotte, P., Network design problem with congestion effects: A case of bilevel programming, Mathe Program 34 (1986), 142-162.
14. Marcotte, P., Savard, G., and Semet, F., A bilevel programming approach to the travelling salesman problem, Oper Res Lett 32 (2004), 240-248.
15. Pigou, A.C., The economics of welfare, Macmillan and Co., London, 1920.
16. Roch, S., Marcotte, P., and Savard, G., An approximation Algorithm for Stackelberg network pricing, e-print, available at http://arxiv.org/abs/cs.GT/ 0409054.
17. Roughgarden, T., Stackelberg scheduling strategies, Proceedings of the 33rd ACM Symposium on Theory of Computing, Crete, 2001, pp. 104-113.
18. Roughgarden, T., Designing networks for selfish users is hard. Proceedings of the the 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, 2001, pp. 472-481.
19. Vazirani, V.V., Approximation algorithms, Springer, Berlin, 2001.
20. Verhoef, E.T., P. Nijkamp, and P. Rietveld, Second-best congestion pricing: The case of an untolled alternative, J Urban Econ 40 (1996), 279-302.
21. Vicente, L., Savard, G., and Júdice, J., Descent approaches for quadratic bilevel programming, J Optimizat Theory Appl 81 (1994), 379-399.