Cost-sharing mechanisms for network design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 139-150

  Gupta, Anupam ^a   Srinivasan, Aravind ^b   Tardos, Éva ^c  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; COSTS; ELECTRONIC TRADING; GAME THEORY; OPTIMIZATION; TREES (MATHEMATICS);

APPROXIMATION FACTOR; APPROXIMATION RATIOS; COST SHARING MECHANISM; COST-SHARING METHODS; GAME-THEORETIC PERSPECTIVES; SINGLE-SOURCE NETWORKS; STEINER TREE PROBLEM; STRATEGY PROOFS;

COST EFFECTIVENESS;

EID: 34748829141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_13     Document Type: Article

References (11)

1. Mihir Bellare and John Rompel. Randomness-efficient oblivious sampling. Proc. 35th FOCS, 276-287, 1994.
2. Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, and Boban Veličković. Approximations of general independent distributions. Proc. 24th STOC, 10-16, 1992.
3. Anupam Gupta, Amit Kumar, Jon Kleinberg, Rajeev Rastogi, and Bülent Yener. Provisioning a Virtual Private Network: A network design problem for multicommodity flow. Proc. 33rd STOC, 389-398, 2001.
4. Anupam Gupta, Amit Kumar, and Tim Roughgarden. Simpler and better approximation algorithms for network design. 35th STOC, 365-372, 2003.
5. K. J. Kent and D. Skorin-Kapov. Population monotonic cost allocations on MSTs. Proceedings of the 6th International Conference on Operational Research (Rovinj, 1996), 43-48. 1996.
6. H. Moulin, S. Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Economic Theory 18:511-533, 2001.
7. Kamal Jain and Vijay Vazirani. Applications of approximation algorithms to cooperative games. Proc. 33rd STOC, 364-372, 2001.
8. David R. Karger and Maria Minkoff. Building Steiner trees with incomplete global knowledge. Proc. 41th FOCS, 613-623, 2000.
9. Martin Pál and Éva Tardos. Group Strategyproof Mechanisms via Primal-Dual Algorithms. Proc. 44th FOCS, 584-593, 2003.
10. Gabriel Robins and Alexander Zelikovsky. Improved Steiner tree approximation in graphs. Proc. 11th SODA, 770-779, 2000.
11. Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math.,8 (1995), 223-250.