Abstract
We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clients, the followers, choose paths to route their demand through the network selfishly and independently of each other, on the basis of minimal cost. Assuming there exist bounds on the costs clients are willing to bear, the problem is to find tariffs such as to maximize the operator’s revenue. Except for the case of a single client, no approximation algorithm is known to date for that problem. We derive the first approximation algorithms for the case of multiple clients. Our results hold for a restricted version of the problem where each client takes at most one tariff arc to route the demand. We prove that this problem is still strongly \({\mathcal NP}\)-hard. Moreover, we show that uniform pricing yields both an m–approximation, and a (1 + ln D)–approximation. Here, m is the number of tariff arcs, and D is upper bounded by the total demand. We furthermore derive lower and upper bounds for the approximability of the pricing problem where the operator must serve all clients, and we discuss some polynomial special cases. A computational study with instances from France Télécom suggests that uniform pricing performs better than theory would suggest.
This research was partially supported by France Télécom Research & Development.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bouhtou, M., van Hoesel, S., van der Kraaij, A.F., Lutton, J.L.: Tariff optimization in networks. Meteor Research Memorandum RM03011, Maastricht University (2003)
Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proceedings of the 4th Annual ACM Conference on Electronic commerce, pp. 98–107 (2003)
Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 521–530 (2003)
Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52, 333–359 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Håstad, J.: Clique is hard to approximate within n 1 − ε. Acta Mathematica 182, 105–142 (1999)
Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming 32, 146–164 (1985)
Karp, R.M., Orlin, J.B.: Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics 3, 37–45 (1981)
Labbé, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Management Science 44, 1608–1622 (1998)
Roch, S., Savard, G., Marcotte, P.: Design and Analysis of an approximation algorithm for Stackelberg network pricing. Optimization Online (2003)
Roughgarden, T., Tardos, É.: How bad is selfish routing? Journal of the Association for Computing Machinery 49(2), 236–259 (2002)
van Hoesel, S., van der Kraaij, A.F., Mannino, C., Oriolo, G., Bouhtou, M.: Polynomial cases of the tarification problem. Meteor Resarch Memorandum RM03053, Maastricht University (2003)
Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: A bibliography review. Journal of Global Optimization 5, 291–306 (1994)
Young, N.E., Tarjan, R.E., Orlin, J.B.: Faster parametric shortest path and minimum-balance algorithms. Networks 21, 205–221 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grigoriev, A., van Hoesel, S., van der Kraaij, A.F., Uetz, M., Bouhtou, M. (2005). Pricing Network Edges to Cross a River. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)