Cost-Sharing Mechanisms for Network Design

被引：0
|
作者：
Anupam Gupta
Aravind Srinivasan
Éva Tardos
机构：
[1] Carnegie Mellon University,Department of Computer Science
[2] University of Maryland at College Park,Department of Computer Science and University of Maryland Institute for Advanced Computer Studies
[3] Cornell University,Department of Computer Science
来源：
Algorithmica | 2008年 / 50卷
关键词：
Steiner Tree; Network Design Problem; Connection Cost; Facility Location Game; Network Design Game;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pp. 365–372, 2003) developed a simple method for a single-source rent-or-buy problem that also yields the best-known approximation ratio for the problem. We show how to use a variant of this method to develop an approximately budget-balanced and group strategyproof cost-sharing method for the problem.
引用
收藏
页码：98 / 119
页数：21
相关论文
共 50 条
  • [1] Cost-sharing mechanisms for network design
    Gupta, Anupam
    Srinivasan, Aravind
    Tardos, Eva
    [J]. ALGORITHMICA, 2008, 50 (01) : 98 - 119
  • [2] Cost-sharing mechanisms for network design
    Gupta, A
    Srinivasan, A
    Tardos, É
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 139 - 150
  • [3] Quantifying Inefficiency in Cost-Sharing Mechanisms
    Roughgarden, Tim
    Sundararajan, Mukund
    [J]. JOURNAL OF THE ACM, 2009, 56 (04)
  • [4] Network Cost-Sharing without Anonymity
    Roughgarden, Tim
    Schrijvers, Okke
    [J]. ALGORITHMIC GAME THEORY, SAGT 2014, 2014, 8768 : 134 - 145
  • [5] Network cost-sharing without anonymity
    Roughgarden, Tim
    Schrijvers, Okke
    [J]. ACM Transactions on Economics and Computation, 2016, 4 (02)
  • [6] Procurement with Cost and Noncost Attributes: Cost-Sharing Mechanisms
    Gupta, Shivam
    Wang, Shouqiang
    Dawande, Milind
    Janakiraman, Ganesh
    [J]. OPERATIONS RESEARCH, 2021, 69 (05) : 1349 - 1367
  • [7] Network cost-sharing without anonymity
    [J]. 1600, Springer Verlag (8768):
  • [8] From packing rules to cost-sharing mechanisms
    Zhang, Chenhao
    Zhang, Guochuan
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 44 (3) : 1578 - 1593
  • [9] From packing rules to cost-sharing mechanisms
    Chenhao Zhang
    Guochuan Zhang
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 1578 - 1593
  • [10] Cost-Sharing Mechanisms for Selfish Bin Packing
    Zhang, Chenhao
    Zhang, Guochuan
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT I, 2017, 10627 : 355 - 368
12345