Author:
Chawla Shuchi,Roughgarden Tim,Sundararajan Mukund
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing 24(3), 440–456 (1995)
2. Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior 47(1), 36–71 (2004)
3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184–193 (1996)
4. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (STOC) (2003)
5. Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Theoretical Computer Science 304, 215–236 (2003)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cost Sharing over Combinatorial Domains;ACM Transactions on Economics and Computation;2022-03-31
2. Combinatorial Cost Sharing;Proceedings of the 2017 ACM Conference on Economics and Computation;2017-06-20
3. From Cost Sharing Mechanisms to Online Selection Problems;Mathematics of Operations Research;2015-08
4. Efficient cost-sharing mechanisms for prize-collecting problems;Mathematical Programming;2014-04-23
5. Improved bounds on the price of stability in network cost sharing games;Proceedings of the fourteenth ACM conference on Electronic commerce;2013-06-16