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 条
  • [1] Decentralized pricing in minimum cost spanning trees
    Jens Leth Hougaard
    Hervé Moulin
    Lars Peter Østerdal
    Economic Theory, 2010, 44 : 293 - 306
  • [2] Updating directed minimum cost spanning trees
    Pollatos, Gerasimos G.
    Telelis, Orestis A.
    Zissimopoulos, Vassilis
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 291 - 302
  • [3] Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
    Lin, Chung-Ming
    Tsai, Yin Te
    Tang, Chuan Yi
    INFORMATION PROCESSING LETTERS, 2006, 99 (02) : 64 - 67
  • [4] Finding maximum-cost minimum spanning trees
    Belal, Ahmed
    Elmasry, Arnr
    3RD ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, 2005, 2005,
  • [5] Improving minimum cost spanning trees by upgrading nodes
    Krumke, SO
    Marathe, MV
    Noltemeier, H
    Ravi, R
    Ravi, SS
    Sundarum, R
    Wirth, HC
    JOURNAL OF ALGORITHMS, 1999, 33 (01) : 92 - 111
  • [6] A fast algorithm for computing minimum routing cost spanning trees
    Campos, Rui
    Ricardo, Manuel
    COMPUTER NETWORKS, 2008, 52 (17) : 3229 - 3247
  • [7] On generalized minimum spanning trees
    Feremans, C
    Labbé, M
    Laporte, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 134 (02) : 457 - 458
  • [8] On partitioning minimum spanning trees
    Guttmann-Beck, Nili
    Hassin, Refael
    Stern, Michal
    DISCRETE APPLIED MATHEMATICS, 2024, 359 : 45 - 54
  • [9] The minimum labeling spanning trees
    Chang, RS
    Leu, SJ
    INFORMATION PROCESSING LETTERS, 1997, 63 (05) : 277 - 282
  • [10] Successive minimum spanning trees
    Janson, Svante
    Sorkin, Gregory B.
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (01) : 126 - 172