Selfish Service Installation in Networks
暂无分享,去创建一个
[1] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[2] Martin Hoefer,et al. Geometric Network Design with Selfish Agents , 2005, COCOON.
[3] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[4] Nikhil R. Devanur,et al. Strategyproof cost-sharing mechanisms for set cover and facility location games , 2003, EC '03.
[5] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[6] Nikhil R. Devanur,et al. Strategyproof cost-sharing Mechanisms for Set Cover and Facility Location Problems , 2002 .
[7] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[8] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[9] Yossi Azar,et al. The Price of Routing Unsplittable Flow , 2005, STOC '05.
[10] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[11] Vahab S. Mirrokni,et al. On spectrum sharing games , 2004, PODC '04.
[12] Stephan Eidenbenz,et al. Equilibria in Topology Control Games for Ad Hoc Networks , 2003, DIALM-POMC '03.
[13] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[14] Xiang-Yang Li,et al. Mechanism Design for Set Cover Games When Elements Are Agents , 2005, AAIM.
[15] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[16] Elias Koutsoupias,et al. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.
[17] Nicole Immorlica,et al. Limitations of cross-monotonic cost sharing schemes , 2005, SODA '05.