Hardness results for multicast cost shar
β
Joan Feigenbaum; Arvind Krishnamurthy; Rahul Sami; Scott Shenker
π
Article
π
2003
π
Elsevier Science
π
English
β 308 KB
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result in gam