1. Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 189–198 (2007)
2. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 511–520 (2003)
3. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Symposium on Foundations of Computer Science FOCS 2004, pp. 295–304 (2004)
4. Annals of Mathematics Study;R.J. Aumann,1959
5. Bilò, V.: On the packing of selfish items. In: Proc. of the 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. IEEE, New York (2006)