Minimum cost spanning tree games and spillover stability

被引：0
|
作者：
Ruud Hendrickx
Jacco Thijssen
Peter Borm
机构：
[1] Tilburg University,Center and Department of Econometrics and Operations Research
[2] University of York,Department of Economics & Related Studies
来源：
Theory and Decision | 2012年 / 73卷
关键词：
Minimum cost spanning tree problems; Transferable utility games; Spillovers; C71; C72;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This article discusses interactive minimum cost spanning tree problems and argues that the standard approach of using a transferable utility game to come up with a fair allocation of the total costs has some flaws. A new model of spillover games is presented, in which each player’s decision whether or not to cooperate is properly taken into account.
引用
收藏
页码：441 / 451
页数：10
相关论文
共 50 条
  • [41] A randomly weighted minimum spanning tree with a random cost constraint
    Frieze, Alan
    Tkocz, Tomasz
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 670 - 689
  • [42] The optimistic TU game in minimum cost spanning tree problems
    Bergantinos, Gustavo
    Vidal-Puga, Juan J.
    INTERNATIONAL JOURNAL OF GAME THEORY, 2007, 36 (02) : 223 - 239
  • [43] Characterization of monotonic rules in minimum cost spanning tree problems
    Gustavo Bergantiños
    Juan Vidal-Puga
    International Journal of Game Theory, 2015, 44 : 835 - 868
  • [44] A New Heuristic for the Minimum Routing Cost Spanning Tree Problem
    Singh, Alok
    ICIT 2008: PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, 2008, : 9 - 13
  • [45] A generalization of obligation rules for minimum cost spanning tree problems
    Bergantinos, Gustavo
    Lorenzo, Leticia
    Lorenzo-Freire, Silvia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (01) : 122 - 129
  • [46] An Experimental Study of Minimum Routing Cost Spanning Tree Algorithms
    Quoc Phan Tan
    Nghia Nguyen Duc
    2013 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION (SOCPAR), 2013, : 158 - 165
  • [47] A randomly weighted minimum spanning tree with a random cost constraint
    Frieze, Alan
    Tkocz, Tomasz
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 670 - 689
  • [48] Characterization of monotonic rules in minimum cost spanning tree problems
    Bergantinos, Gustavo
    Vidal-Puga, Juan
    INTERNATIONAL JOURNAL OF GAME THEORY, 2015, 44 (04) : 835 - 868
  • [49] Parallel approximation algorithms for minimum routing cost spanning tree
    Chen, Kun
    Hsieh, Yung En
    Lu, Ping Jung
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2013, 8 (04) : 336 - 348
  • [50] An axiomatic approach in minimum cost spanning tree problems with groups
    Bergantinos, Gustavo
    Gomez-Rua, Maria
    ANNALS OF OPERATIONS RESEARCH, 2015, 225 (01) : 45 - 63
12345