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 条
  • [21] List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs
    Esmer, Barış Can
    Focke, Jacob
    Marx, Dániel
    Rzążewski, Pawel
    Leibniz International Proceedings in Informatics, LIPIcs, 308
  • [22] Tree-coloring problems of bounded treewidth graphs
    Bi Li
    Xin Zhang
    Journal of Combinatorial Optimization, 2020, 39 : 156 - 169
  • [23] Tree-coloring problems of bounded treewidth graphs
    Li, Bi
    Zhang, Xin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (01) : 156 - 169
  • [24] Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
    Bateni, Mohammadhossein
    Hajiaghayi, Mohammadtaghi
    Marx, Daniel
    JOURNAL OF THE ACM, 2011, 58 (05)
  • [25] Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
    Bateni, Mohammad Hossein
    Hajiaghayi, Mohammad Taghi
    Marx, Daniel
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 211 - 220
  • [26] Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
    Cabello, Sergio
    ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (02)
  • [27] Minimum Spanning Tree on Uncertain Graphs
    Zhang, Anzhen
    Zou, Zhaonian
    Li, Jianzhong
    Gao, Hong
    WEB INFORMATION SYSTEMS ENGINEERING - WISE 2016, PT II, 2016, 10042 : 259 - 274
  • [28] Constructing minimum changeover cost arborescenses in bounded treewidth graphs
    Gozupek, Didem
    Shachnai, Hadas
    Shalom, Mordechai
    Zaks, Shmuel
    THEORETICAL COMPUTER SCIENCE, 2016, 621 : 22 - 36
  • [29] Equitable list tree-coloring of bounded treewidth graphs
    Li, Yan
    Zhang, Xin
    THEORETICAL COMPUTER SCIENCE, 2021, 855 : 61 - 67
  • [30] Minimum congestion spanning trees in planar graphs
    Ostrovskii, M. I.
    DISCRETE MATHEMATICS, 2010, 310 (6-7) : 1204 - 1209
12345