1. Andelman, N., Feldman, M., Mansour, Y. Strong price of anarchy. In: Proceeding of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, 189–198
2. Aumann, R. Acceptable Points in General Cooperative n-Person Games. In: Contributions to the Theory of Games IV, Annals of Mathematics 40, ed. by R.D. Luce, A.W. Tucker, 1959, 287–324
3. Feldman, M., Tamir, T. Approximate Strong Equilibrium in Job Scheduling Games. To appear in: Journal of Artificial Intelligence Research
4. Fotakis, D., Kontogiannis, S., Mavronicolas, M., Spiraklis, P. The structure and complexity of Nash equilibria for a selfish routing game. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, 510–519
5. Graham, R. Bounds on multiprocessing timing anomalies. SIAM J. Applied Mathematics, 17: 263–269 (1969)