A group-strategyproof cost sharing mechanism for the steiner forest game

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1319-1341

  KöNemann, Jochen ^a   Leonard, Stefano ^b   Schäfer, Guido ^c   Van Zwam, Stefan H M ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation algorithms; Group strategyproofness; Mechanism design; Primal dual algorithms; Steiner forests

Indexed keywords

COST EFFECTIVENESS; GAME THEORY; LINEAR PROGRAMMING; LINEARIZATION; MACHINE DESIGN; TREES (MATHEMATICS);

BUDGET BALANCES; COST SHARING MECHANISMS; GROUP-STRATEGYPROOFNESS; LINEAR PROGRAMMING RELAXATIONS; MECHANISM DESIGN; PRIMAL DUALS; PRIMAL-DUAL ALGORITHMS; STEINER FOREST GAMES; STEINER FOREST PROBLEMS; STEINER FORESTS; STEINER TREE GAMES; WEIGHTED GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 55249095319     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050646408     Document Type: Article

References (15)

1. A. AGARWAL AND M. CHARIKAR, On the advantage of network coding for improving network throughput, in Proceedings of the IEEE Information Theory Workshop, San Antonio, TX, 2004, pp. 247-249.
2. A. AGRAWAL, P. KLEIN, AND R. RAVI, When trees collide: An approximation algorithm for the generalized Steiner problem on networks, SIAM J. Comput., 24 (1995), pp. 440-456.
3. Y. P. ANEJA, An integer linear programming approach to the Steiner problem in graphs. Networks, 10 (1980), pp. 167-178.
4. S. ARORA, C. LUND, R. MOTWANJ, M. SUDAN. AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
5. M. BERN AND P. PLASSMANN, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett., 32 (1989), pp. 171-176.
6. J. EDMONDS, Optimum branchings, J. Res. Nat. Bur. Standards Sect. B. 71B (1967), pp. 233-240.
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, W. H. Freeman and Co., San Francisco, CA, 1979.
8. M. X. GOEMANS AND D. P. WILLIAMSON, A general approximation technique for constrained forest problems, SIAM J. Comput., 24 (1995), pp. 296-317.
9. N. IMMORLICA, M. MAHDIAN, AND V. S. MIRROKNI, Limitations of cross-mono tonic cost sharing schemes y in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 602-611.
10. K. JAIN AND V. V. VAZIRANI, Applications of approximation algorithms to cooperative games, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 364-372.
11. K. KENT AND D. SKORIN-KAPOV, Population raonotonic cost allocation on MST's, in Proceedings of the 6th International Conference on Operational Research. Croatian Oper. Res. Soc., Zagreb, 1996, pp. 43-48.
12. J. KÖNEMANN, S. LEONARDI, AND G. SCHAFER, A group-strategy proof mechanism for Steiner forests, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 612 - 619.
13. J. KONEMANN, S. LEONARDI, G. SCHÄFER, AND S. VAN ZWAM, From primal-dual to cost shares and back: A stronger LP relaxation for the Steiner forest problem, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming. Lecture Notes in Comput. Sci. 3580, Springer-Verlag, Berlin, Heidelberg, 2005, pp, 930-942.
14. H. MOULIN AND S. SHENKER, Strategyproof sharing of submodular costs: Budget balance versus efficiency, Econom. Theory, 18 (2001), pp. 511-533.
15. M. PÁL AND É. TARDOH, Group strategyproof mechanisms via primal-dual algorithms, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2003, pp. 584-593.