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

被引：0
|
作者：
Jean Cardinal
Erik D. Demaine
Samuel Fiorini
Gwenaël Joret
Ilan Newman
Oren Weimann
机构：
[1] Université Libre de Bruxelles (ULB),Département d’Informatique, CP 212
[2] MIT Computer Science and Artificial Intelligence Laboratory,Département de Mathématique, CP 216
[3] Université Libre de Bruxelles (ULB),Department of Computer Science
[4] University of Haifa,undefined
来源：
Journal of Combinatorial Optimization | 2013年 / 25卷
关键词：
The Stackelberg games; Network pricing games; Minimum spanning; Baunded treewidth;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：19 / 46
页数：27
相关论文
共 50 条
  • [1] The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenael
    Newman, Ilan
    Weimann, Oren
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (01) : 19 - 46
  • [2] The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenael
    Newman, Ilan
    Weimann, Oren
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 125 - +
  • [3] Computing Square Colorings on Bounded-Treewidth and Planar Graphs
    Agrawal, Akanksha
    Marx, Daniel
    Neuen, Daniel
    Slusallek, Jasper
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2087 - 2110
  • [4] The Stackelberg Minimum Spanning Tree Game
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenael
    Langerman, Stefan
    Newman, Ilan
    Weimann, Oren
    ALGORITHMICA, 2011, 59 (02) : 129 - 144
  • [5] The Stackelberg Minimum Spanning Tree Game
    Jean Cardinal
    Erik D. Demaine
    Samuel Fiorini
    Gwenaël Joret
    Stefan Langerman
    Ilan Newman
    Oren Weimann
    Algorithmica, 2011, 59 : 129 - 144
  • [6] The stackelberg minimum spanning tree game
    Cardinal, Jean
    Demaine, Erik D.
    Fiorini, Samuel
    Joret, Gwenaeal
    Langerman, Stefan
    Newman, Ilan
    Weimann, Oren
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 64 - +
  • [7] Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs
    Jacob, Hugo
    Pilipczuk, Marcin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 287 - 299
  • [8] An optimal algorithm for BISECTION for bounded-treewidth graphs
    Hanaka, Tesshu
    Kobayashi, Yasuaki
    Sone, Taiga
    arXiv, 2020,
  • [9] Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    INTERNET AND NETWORK ECONOMICS, 2010, 6484 : 75 - +
  • [10] Specializations and generalizations of the Stackelberg minimum spanning tree game
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 643 - 657
12345