The Community for Technology Leaders
Green Image
Issue No. 08 - August (2009 vol. 20)
ISSN: 1045-9219
pp: 1089-1101
Nandan Garg , Wayne State University, Detroit
Daniel Grosu , Wayne State University, Detroit
The problem of sharing the cost of multicast transmissions was studied in the past, and two mechanisms, Marginal Cost (MC) and Shapley Value (SH), were proposed to solve it. Although both of them are strategyproof mechanisms, the distributed protocols implementing them are susceptible to manipulation by autonomous nodes. We propose a distributed Shapley Value mechanism in which the participating nodes do not have incentives to deviate from the mechanism specifications. We show that the proposed mechanism is a faithful implementation of the Shapley Value mechanism. We experimentally investigate the performance of the existing and the proposed cost-sharing mechanisms by implementing and deploying them on PlanetLab. We compare the execution time of MC and SH mechanisms for the Tamper-Proof and Autonomous Node models. We also study the convergence and scalability of the mechanisms by varying the number of nodes and the number of users per node. We show that the MC mechanisms generate a smaller revenue compared to the SH mechanisms, and thus, they are not attractive to the content provider. We also show that increasing the number of users per node is beneficial for the systems implementing the SH mechanisms from both computational and economic perspectives.
Multicast, cost sharing, faithful implementation, algorithmic mechanism design.

N. Garg and D. Grosu, "A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 1089-1101, 2008.
88 ms
(Ver 3.3 (11022016))