An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1153-1162

  Gupta, A ^a   Konemann J ^b   Leonardi, S ^c   Ravi, R ^d   Schafer G ^e  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d CARNEGIE MELLON UNIVERSITY   (United States)

^e TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; FORESTRY; GAME THEORY; GRAPH THEORY;

EFFICIENT COSTS; FEASIBLE SOLUTION; GAME-THEORETIC; NON NEGATIVES; PRIZE-COLLECTING STEINER FORESTS; SERVICE PROVIDER; STRATEGYPROOF MECHANISM; UNDIRECTED GRAPH;

COSTS;

EID: 84969172410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Ajit Agrawal, Philip Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput., 24(3):440-456, 1995. (Preliminary version in 23rd STOC, 1991).
2. Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker. Approximation and collusion in multicast cost sharing. Games and Economic Behavior, 47(1):36-71, 2004.
3. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
4. Yair Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th Symposium on the Foundations of Computer Science (FOCS), pages 184-193, 1996.
5. M. Bern and P. Plassman. The Steiner problem with edge lengths 1 and 2. Information Processing Letters, 32:171-176, 1989.
6. Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, and David P. Williamson. A note on the prize collecting traveling salesman problem. Math. Program., 59:413-420, 1993.
7. S. Chawla, T. Roughgarden, and M. Sundararajan. Optimal cost-sharing mechanisms for steiner forest problems. submitted to WINE.
8. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci., 69(3):485-497, 2004.
9. Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker. Hardness results for multicast costsharing. Theoretical Computer Science, 304:215-236, 2003.
10. Joan Feigenbaum, Christos H. Papadimitriou, and Scott Shenker. Sharing the cost of multicast transmissions. J. Comput. System Sci., 63(1):21-41, 2001. Special issue on internet algorithms.
11. Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995. (Preliminary version in 5th SODA, 1994).
12. J. Green, E. Kohlberg, and J. J. Laffont. Partial equilibrium approach to the free rider problem. Journal of Public Economics, 6:375-394, 1976.
13. A. Gupta, A. Srinivasan, and É. Tardos. Cost-sharing mechanisms for network design. In Proceedings of the Seventh International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2004.
14. Mohammad Taghi Hajiaghayi and Kamal Jain. The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pages 631-640, 2006.
15. N. Immorlica, M. Mahdian, and V. S. Mirrokni. Limitations of cross-monotonic cost sharing schemes. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 602-611. ACM Press, 2005.
16. Kamal Jain and Vijay Vazirani. Applications of approximation algorithms to cooperative games. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pages 364-372, 2001.
17. Kathryn J. Kent and Darko Skorin-Kapov. Population monotonic cost allocations on MSTs. In Proceedings of the 6th International Conference on Operational Research (Rovinj, 1996), pages 43-48. Croatian Oper. Res. Soc., Zagreb, 1996.
18. Jochen Könemann, Stefano Leonardi, and Guido Schäfer. A group-strategyproof mechanism for Steiner forests. In Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, pages 612-619. ACM Press, 2005.
19. Jochen Könemann, Stefano Leonardi, Guido Schäfer, and Stefan van Zwam. From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem. In Automata, languages and programming, volume 3580 of Lecture Notes in Comput. Sci., pages 930-942. Springer, Berlin, 2005.
20. Stefano Leonardi and Guido Schäfer. Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci., 326(1-3):431-442, 2004.
21. Hervé Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare, 16:279-320, 1999.
22. Hervé Moulin and Scott Shenker. Strategyproof sharing of submodular costs: budget balance versus efficiency. Econom. Theory, 18(3):511-533, 2001.
23. Martin Pál and Éva Tardos. Group strategyproof mechanisms via primal-dual algorithms. In Proceedings of the 44th Symposium on the Foundations of Computer Science (FOCS), pages 584-593, 2003.
24. K. Roberts. The characterization of implementable choice rules. In J. J. Laffont, editor, Aggregation and Revelation of Preferences. North-Holland, 1979.
25. T. Roughgarden and M. Sundararajan. New trade-offs in cost-sharing mechanisms. In STOC, 2006.