Author:
Bleischwitz Yvonne,Monien Burkhard,Schoppmann Florian,Tiemann Karsten
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R.: Approximation and collusion in multicast cost sharing. Games and Economic Behaviour 47, 36–71 (2004)
2. Becchetti, L., Könemann, J., Leonardi, S., Pál, M.: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 375–384. ACM Press, New York (2005)
3. Lecture Notes in Computer Science;Y. Bleischwitz,2006
4. Lecture Notes in Computer Science;J. Brenner,2007
5. Graham, R.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17(2), 416–429 (1969)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pseudonyms in Cost-Sharing Games;Lecture Notes in Computer Science;2009
2. The Power of Small Coalitions in Cost Sharing;Lecture Notes in Computer Science;2008
3. To Be or Not to Be (Served);Lecture Notes in Computer Science