Decentralized pricing in minimum cost spanning trees

被引:11
|
作者
Hougaard, Jens Leth [2 ]
Moulin, Herve [1 ]
Osterdal, Lars Peter [3 ]
机构
[1] Rice Univ, Dept Econ, Houston, TX 77251 USA
[2] Univ Copenhagen, Dept Food & Resource Econ, DK-1958 Frederiksberg C, Denmark
[3] Univ Copenhagen, Dept Econ, DK-1455 Copenhagen K, Denmark
关键词
Pricing rules; Minimum cost spanning trees; Canonical pricing rule; Stand-alone cost; Decentralization; ALLOCATION; GAMES;
D O I
10.1007/s00199-009-0485-6
中图分类号
F [经济];
学科分类号
02 ;
摘要
In the minimum cost spanning tree model we consider decentralized pricing rules, i.e., rules that cover at least the efficient cost while the price charged to each user only depends upon his own connection costs. We define a canonical pricing rule and provide two axiomatic characterizations. First, the canonical pricing rule is the smallest among those that improve upon the Stand Alone bound, and are either superadditive or piece-wise linear in connection costs. Our second, direct characterization relies on two simple properties highlighting the special role of the source cost.
引用
收藏
页码:293 / 306
页数:14
相关论文
共 50 条
  • [31] Minimum spanning trees for community detection
    Wu, Jianshe
    Li, Xiaoxiao
    Jiao, Licheng
    Wang, Xiaohua
    Sun, Bo
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (09) : 2265 - 2277
  • [32] Minimum restricted diameter spanning trees
    Hassin, R
    Levin, A
    APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 175 - 184
  • [33] CUMULATIVE CONSTRUCTION OF MINIMUM SPANNING TREES
    ROGER, JH
    CARPENTE.RG
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 1971, 20 (02) : 192 - &
  • [34] Minimum Spanning Trees with Sums of Ratios
    Christopher C. Skiscim
    Susan W. Palocsay
    Journal of Global Optimization, 2001, 19 : 103 - 120
  • [35] On minimum edge ranking spanning trees
    Makino, K
    Uno, Y
    Ibaraki, T
    JOURNAL OF ALGORITHMS, 2001, 38 (02) : 411 - 437
  • [36] Distributed verification of minimum spanning trees
    Amos Korman
    Shay Kutten
    Distributed Computing, 2007, 20 : 253 - 266
  • [37] On Sorting, Heaps, and Minimum Spanning Trees
    Gonzalo Navarro
    Rodrigo Paredes
    Algorithmica, 2010, 57 : 585 - 620
  • [38] Balanced partition of minimum spanning trees
    Andersson, M
    Gudmundsson, J
    Levcopoulos, C
    Narasimhan, G
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2003, 13 (04) : 303 - 316
  • [39] Minimum bounded degree spanning trees
    Goemans, Michel X.
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 273 - 282
  • [40] Balanced partition of minimum spanning trees
    Andersson, M
    Gudmundsson, J
    Levcopoulos, C
    Narasimhan, G
    COMPUTATIONAL SCIENCE-ICCS 2002, PT III, PROCEEDINGS, 2002, 2331 : 26 - 35