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

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationInternet and Network Economics - 5th International Workshop, WINE 2009, Proceedings
Pages125-136
Number of pages12
DOIs
StatePublished - 2009
Event5th International Workshop on Internet and Network Economics, WINE 2009 - Rome, Italy
Duration: 14 Dec 200918 Dec 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5929 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop on Internet and Network Economics, WINE 2009
Country/TerritoryItaly
CityRome
Period14/12/0918/12/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs'. Together they form a unique fingerprint.

Cite this