An approximation algorithm for Stackelberg network pricing

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly NP-hard. We then provide a polynomial time algorithm with a worst-case precision guarantee of ${1/2}\log_2 m_T+1$, where $m_T$ denotes the number of toll arcs. Finally we show that the approximation is tight with respect to a natural relaxation by constructing a family of instances for which the relaxation gap is reached.

[1]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

[2]  L. N. Vicente,et al.  Descent approaches for quadratic bilevel programming , 1994 .

[3]  Robert G. Jeroslow,et al.  The polynomial hierarchy and a simple model for competitive analysis , 1985, Math. Program..

[4]  A. C. Pigou.  Economics of welfare , 1920 .

[5]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[6]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[7]  M. Patriksson,et al.  SIDE CONSTRAINED TRAFFIC EQUILIBRIUM MODELS: TRAFFIC MANAGEMENT THROUGH LINK TOLLS. , 1998 .

[8]  Tim Roughgarden,et al.  Stackelberg scheduling strategies , 2001, STOC '01.

[9]  Patrice Marcotte,et al.  Network design problem with congestion effects: A case of bilevel programming , 1983, Math. Program..

[10]  P. Marcotte,et al.  An approximation algorithm for Stackelberg network pricing , 2005 .

[11]  Martine Labbé,et al.  On a class of bilevel programs , 2000 .

[12]  P. Nijkamp,et al.  SECOND BEST CONGESTION PRICING: THE CASE OF AN UNTOLLED ALTERNATIVE. IN: URBAN TRANSPORT , 1996 .

[13]  D. Hearn,et al.  Solving Congestion Toll Pricing Models , 1998 .

[14]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[15]  Tim Roughgarden,et al.  Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Deborah Estrin,et al.  Pricing in computer networks: motivation, formulation, and example , 1993, TNET.

[18]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[19]  Pierre Hansen,et al.  Links Between Linear Bilevel and Mixed 0–1 Programming Problems , 1995 .

[20]  Patrice Marcotte,et al.  A bilevel programming approach to the travelling salesman problem , 2004, Oper. Res. Lett..

[21]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[22]  P. Marcotte,et al.  A bilevel model of taxation and its application to optimal highway pricing , 1996 .