The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Author(s)
Cardinal, Jean; Demaine, Erik D.; Fiorini, Samuel; Joret, Gwenaël; Newman, Ilan; Weimann, Oren; ... Show more Show less
DownloadDemaine_The Stackelberg.pdf (242.0Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem introduced at WADS’07. The game is played on a graph, whose edges are colored either red or blue, and where the red edges have a given fixed cost. 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.
Date issued
2009-01Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Internet and network economics (WINE) (Lecture notes in computer science, v. 5929)
Publisher
Springer
Citation
Cardinal, Jean et al. “The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs.” Internet and Network Economics. Ed. Stefano Leonardi. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 125-136. Copyright © 2009, Springer
Version: Author's final manuscript
ISBN
9783642108402
3642108407