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

Jean Cardinal (), Erik D. Demaine (), Samuel Fiorini (), Gwenaël Joret (), Ilan Newman () and Oren Weimann ()
Additional contact information
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

Journal of Combinatorial Optimization, 2013, vol. 25, issue 1, No 2, 19-46

Abstract: 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.

Keywords: The Stackelberg games; Network pricing games; Minimum spanning; Baunded treewidth (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9414-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9414-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9414-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().