B. S. Baker, E. G. Coffman, J. , and R. L. Rivest, Orthogonal Packings in Two Dimensions, SIAM Journal on Computing, vol.9, issue.4, pp.846-855, 1980.
DOI : 10.1137/0209064
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.8883

S. N. Zhuk, Approximate algorithms to pack rectangles into several strips, Discrete Mathematics and Applications, vol.16, issue.1, pp.73-85, 2006.
DOI : 10.1515/156939206776241264

D. Ye, X. Han, and G. Zhang, On-Line Multiple-Strip Packing, Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications, pp.155-165, 2009.
DOI : 10.1007/978-3-642-02026-1_14
URL : http://dx.doi.org/10.1016/j.tcs.2009.09.029

K. Jansen and C. Otte, Approximation algorithms for multiple strip packing, Proceedings of 7th Workshop on Approximation and Online Algorithms (WAOA), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00953421

U. Schwiegelshohn, A. Tchernykh, and R. Yahyapour, Online scheduling in grids, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-10, 2008.
DOI : 10.1109/IPDPS.2008.4536273

F. Pascual, K. Rzadca, and D. Trystram, Cooperation in multi-organization scheduling, " in Euro-Par 2007 Parallel Processing, ser. Lecture Notes in Computer Science, pp.224-233, 2007.

J. Cohen, D. Cordeiro, D. Trystram, and F. Wagner, Analysis of Multi-Organization Scheduling Algorithms, pp.367-379, 2010.
DOI : 10.1007/978-3-642-15291-7_34
URL : https://hal.archives-ouvertes.fr/inria-00536510

F. Ooshita, T. Izumi, and T. Izumi, A generalized multiorganization scheduling on unrelated parallel machines, International Conference on Parallel and Distributed Computing , Applications and Technologies (PDCAT), pp.26-33, 2009.

E. Koutsoupias and C. Papadimitriou, Worst-case equilibria, Proceedings of 16th Annual Symposium on Theoretical Aspects of Computer Science, ser. LNCS, pp.404-413, 1999.

N. Nisam, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory, 2007.

E. Even-dar, A. Kesselman, and Y. Mansour, Convergence Time to Nash Equilibria, ACM Transactions on Algorithms, vol.3, issue.3, p.32, 2007.
DOI : 10.1007/3-540-45061-0_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.5811

I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli, Tight Bounds for Selfish and Greedy Load Balancing, Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, pp.311-322, 2006.
DOI : 10.1007/11786986_28

M. Voorneveld, Characterization of Pareto dominance, Operations Research Letters, vol.31, issue.1, pp.7-11, 2003.
DOI : 10.1016/S0167-6377(02)00189-X

D. S. Hochbaum and D. B. Shmoys, A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach, SIAM Journal on Computing, vol.17, issue.3, pp.539-551, 1988.
DOI : 10.1137/0217033

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.8131