Cross-monotonic cost sharing methods for connected facility location games
暂无分享,去创建一个
[1] Aravind Srinivasan,et al. Cost-Sharing Mechanisms for Network Design , 2004, APPROX-RANDOM.
[2] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[3] Nikhil R. Devanur,et al. Strategyproof cost-sharing mechanisms for set cover and facility location games , 2003, EC '03.
[4] H. Moulin,et al. Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .
[5] Chaitanya Swamy,et al. Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.
[6] Tim Roughgarden,et al. Simpler and better approximation algorithms for network design , 2003, STOC '03.
[7] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[8] Éva Tardos,et al. Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..