IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v25y2013i1d10.1007_s10878-011-9414-2.html
   My bibliography  Save this article

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

Author

Listed:
  • Jean Cardinal

    (Université Libre de Bruxelles (ULB))

  • Erik D. Demaine

    (MIT Computer Science and Artificial Intelligence Laboratory)

  • Samuel Fiorini

    (Université Libre de Bruxelles (ULB))

  • Gwenaël Joret

    (Université Libre de Bruxelles (ULB))

  • Ilan Newman

    (University of Haifa)

  • Oren Weimann

    (University of Haifa)

Abstract

The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem played on a graph representing a network. Its edges are colored either red or blue, and the red edges have a given fixed cost, representing the competitor’s prices. The first player chooses an assignment of prices to the blue edges, and the second player then buys the cheapest spanning tree, using any combination of red and blue edges. The goal of the first player is to maximize the total price of purchased blue edges. We study this problem in the cases of planar and bounded-treewidth graphs. We show that the problem is NP-hard on planar graphs but can be solved in polynomial time on graphs of bounded treewidth.

Suggested Citation

  • Jean Cardinal & Erik D. Demaine & Samuel Fiorini & Gwenaël Joret & Ilan Newman & Oren Weimann, 2013. "The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 19-46, January.
    • Handle: RePEc:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9414-2
    DOI: 10.1007/s10878-011-9414-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-011-9414-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-011-9414-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Martine Labbé & Patrice Marcotte & Gilles Savard, 1998. "A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing," Management Science, INFORMS, vol. 44(12-Part-1), pages 1608-1622, December.
    2. Grigoriev, A. & van Hoesel, C.P.M. & van der Kraaij, A.F. & Uetz, M.J. & Bouhtou, M., 2004. "Pricing network edges to cross a river," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2001. "A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network," Transportation Science, INFORMS, vol. 35(4), pages 345-358, November.
    4. van Hoesel, C.P.M., 2006. "An overview of Stackelberg pricing in networks," Research Memorandum 043, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    5. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2000. "A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem," Transportation Science, INFORMS, vol. 34(3), pages 289-302, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van Hoesel, Stan, 2008. "An overview of Stackelberg pricing in networks," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1393-1402, September.
    2. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2008. "Joint Design and Pricing on a Network," Operations Research, INFORMS, vol. 56(5), pages 1104-1115, October.
    3. Wang, Zhenjie & Zhang, Dezhi & Tavasszy, Lóránt & Fazi, Stefano, 2023. "Integrated multimodal freight service network design and pricing with a competing service integrator and heterogeneous shipper classes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    4. Christine Tawfik & Sabine Limbourg, 2019. "A Bilevel Model for Network Design and Pricing Based on a Level-of-Service Assessment," Transportation Science, INFORMS, vol. 53(6), pages 1609-1626, November.
    5. Afşar, Sezin & Brotcorne, Luce & Marcotte, Patrice & Savard, Gilles, 2016. "Achieving an optimal trade-off between revenue and energy peak within a smart grid environment," Renewable Energy, Elsevier, vol. 91(C), pages 293-301.
    6. Tawfik, Christine & Gendron, Bernard & Limbourg, Sabine, 2022. "An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model," European Journal of Operational Research, Elsevier, vol. 300(2), pages 512-526.
    7. Aimé Kamgaing Kuiteingf & Patrice Marcotte & Gilles Savard, 2017. "Network Pricing of Congestion-Free Networks: The Elastic and Linear Demand Case," Transportation Science, INFORMS, vol. 51(3), pages 791-806, August.
    8. Mustapha Bouhtou & Stan van Hoesel & Anton F. van der Kraaij & Jean-Luc Lutton, 2007. "Tariff Optimization in Networks," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 458-469, August.
    9. Li Li & Sridhar Tayur, 2005. "Medium-Term Pricing and Operations Planning in Intermodal Transportation," Transportation Science, INFORMS, vol. 39(1), pages 73-86, February.
    10. Patrice Marcotte & Anne Mercier & Gilles Savard & Vedat Verter, 2009. "Toll Policies for Mitigating Hazardous Materials Transport Risk," Transportation Science, INFORMS, vol. 43(2), pages 228-243, May.
    11. Martine Labbé & Alessia Violin, 2016. "Bilevel programming and price setting problems," Annals of Operations Research, Springer, vol. 240(1), pages 141-169, May.
    12. Quang Minh Bui & Bernard Gendron & Margarida Carvalho, 2022. "A Catalog of Formulations for the Network Pricing Problem," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2658-2674, September.
    13. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    14. Alizadeh, S.M. & Marcotte, P. & Savard, G., 2013. "Two-stage stochastic bilevel programming over a transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 92-105.
    15. José Correa & Tobias Harks & Vincent J. C. Kreuzen & Jannik Matuschke, 2017. "Fare Evasion in Transit Networks," Operations Research, INFORMS, vol. 65(1), pages 165-183, February.
    16. François Gilbert & Patrice Marcotte & Gilles Savard, 2014. "Mixed-logit network pricing," Computational Optimization and Applications, Springer, vol. 57(1), pages 105-127, January.
    17. Budnitzki, Alina, 2014. "Computation of the optimal tolls on the traffic network," European Journal of Operational Research, Elsevier, vol. 235(1), pages 247-251.
    18. Escudero, Laureano F. & Monge, Juan F. & Rodríguez-Chía, Antonio M., 2020. "On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty," European Journal of Operational Research, Elsevier, vol. 287(1), pages 262-279.
    19. Ankur Sinha & Zhichao Lu & Kalyanmoy Deb & Pekka Malo, 2020. "Bilevel optimization based on iterative approximation of multiple mappings," Journal of Heuristics, Springer, vol. 26(2), pages 151-185, April.
    20. Laure Cabantous & Gilbert Laporte, 2015. "ASP, The Art and Science of Practice: Academia-Industry Interfacing in Operations Research in Montréal," Interfaces, INFORMS, vol. 45(6), pages 554-566, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9414-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.