An axiomatic approach in minimum cost spanning tree problems with groups

被引:0
|
作者
Gustavo Bergantiños
María Gómez-Rúa
机构
[1] Universidade de Vigo,Facultad de Economía, Campus Lagoas
来源
Annals of Operations Research | 2015年 / 225卷
关键词
Minimum cost spanning tree problems; Folk rule; Cost sharing; Axiomatization;
D O I
暂无
中图分类号
学科分类号
摘要
We study minimum cost spanning tree problems with groups, where agents are located in different villages, cities, etc. The groups are formed by agents living in the same village. In Bergantiños and Gómez-Rúa (Economic Theory 43:227–262, 2010) we define the rule F as the Owen value of the irreducible game with groups and we prove that F generalizes the folk rule of minimum cost spanning tree problems. Bergantiños and Vidal-Puga (Journal of Economic Theory 137:326–352, 2007a) give two characterizations of the folk rule. In the first one they characterize it as the unique rule satisfying cost monotonicity, population monotonicity and equal share of extra costs. In the second characterization of the folk rule they replace cost monotonicity by independence of irrelevant trees and population monotonicity by separability. In this paper we extend such characterizations to our setting. Some of the properties are the same (cost monotonicity and independence of irrelevant trees) and the other need to be adapted. In general, we do it by claiming the property twice: once among the groups and the other among the agents inside the same group.
引用
收藏
页码:45 / 63
页数:18
相关论文
共 50 条
  • [41] The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
    Bergantinos, Gustavo
    Vidal-Puga, Juan
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) : 1279 - 1283
  • [42] A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
    Gustavo Bergantiños
    Silvia Lorenzo-Freire
    Economic Theory, 2008, 35 : 523 - 538
  • [43] A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
    Bergantinos, Gustavo
    Lorenzo-Freire, Silvia
    ECONOMIC THEORY, 2008, 35 (03) : 523 - 538
  • [44] A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
    Trudeau, Christian
    GAMES AND ECONOMIC BEHAVIOR, 2012, 75 (01) : 402 - 412
  • [45] Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
    Seo, Dae Young
    Lee, D. T.
    Lin, Tien-Ching
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 283 - +
  • [46] Wisdom of the Crowds in Minimum Spanning Tree Problems
    Yi, Sheng Kung Michael
    Steyvers, Mark
    Lee, Michael D.
    Dry, Matthew
    COGNITION IN FLUX, 2010, : 1840 - 1845
  • [47] On bilevel minimum and bottleneck spanning tree problems
    Shi, Xueyu
    Zeng, Bo
    Prokopyev, Oleg A.
    NETWORKS, 2019, 74 (03) : 251 - 273
  • [48] The complexity of Minimum Ratio Spanning Tree problems
    Skiscim, CC
    Palocsay, SW
    JOURNAL OF GLOBAL OPTIMIZATION, 2004, 30 (04) : 335 - 346
  • [49] An algebraic framework for minimum spanning tree problems
    Guttmann, Walter
    THEORETICAL COMPUTER SCIENCE, 2018, 744 : 37 - 55
  • [50] The Complexity of Minimum Ratio Spanning Tree Problems
    Christopher C. Skiścim
    Susan W. Palocsay
    Journal of Global Optimization, 2004, 30 : 335 - 346