Sciweavers

Share
SIAMCOMP
2008

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game

8 years 10 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in an undirected, edge-weighted graph G. In this paper we show that a natural adaptation of the primaldual Steiner forest algorithm of Agrawal, Klein and Ravi [When trees collide: An approximation algorithm for the generalized Steiner problem in networks, SIAM Journal on Computing, 24(3):445
Jochen Könemann, Stefano Leonardi, Guido Sch&
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIAMCOMP
Authors Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam
Comments (0)
books