Efficient strategyproof multicast in selfish networks

In this paper, we propose several strategyproof mechanisms for multicast for both node weighted graphs and link weighted graphs. A node in node weighted graphs or a link in link weighted graphs is called an agent. For a multicast with a source node and a set of receiver nodes, we assume that they will pay each agent to carry the traffic from source to receivers. The utility of an agent is its payment received, minus its cost if it is in the multicast tree. We assume that the cost of each agent is private and each agent can manipulate its weight to maximize its utility. A payment scheme is strategyproof if every agent maximizes its utility when it reports its cost truthfully. In this paper, we proposed several strategyproof payment schemes based on various structures. We prove that each of our payment schemes is optimum for the corresponding structure used.