Share the Multicast Payment Fairly

Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certain fair way has been studied widely in literature. When the agents, either the links or the nodes, in the network are selfish, it is desirable to pay the agents in a proper way such that each agent still reveals its true cost, a property known as strategyproofness. Several strategyproof mechanisms have been proposed based on several different multicast structures, and it is natural that the payments instead of the costs should be shared among the receivers. Motivated by this, we study how the payment should be shared among the receivers in a fair way when the payment is computed via a strategyproof mechanism based on some low cost multicast structure. Specifically, when links are selfish agents, based on a strategyproof mechanism whose multicast tree is at most 2 times the optimal, we propose a payment sh...

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Weizhao Wang, Xiang-Yang Li, Zheng Sun
• Keywords: COCOON 2005, Multicast, Payment, Strategyproof Mechanism