1. S. Albers, On the value of coordination in network design, in: Proc. 19th Annual ACM–SIAM Symposium on Discrete Algorithms, 2008.
2. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, T. Roughgarden, The price of stability for network design with fair cost allocation, in: Proc. 45th Symposium on Foundations of Computer Science, 2004.
3. V. Bilò, I. Caragiannis, A. Fanelli, G. Monaco, Improved lower bounds on the price of stability of undirected network design games, in: Proc. 3rd International Symposium on Algorithmic Game Theory, 2010.
4. H.-L. Chen, T. Roughgarden, Network design with weighted players, in: Proc. 18th ACM Symposium on Parallelism in Algorithms and Architectures, 2006.
5. H.-L. Chen, T. Roughgarden, G. Valiant, Designing networks with good equilibria, in: Proc. 19th ACM–SIAM Symposium on Discrete Algorithms, 2008.