Bin packing of selfish items

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5385 LNCS, Issue , 2008, Pages 446-453

  Yu, Guosong ^a,b   Zhang, Guochuan ^a,c  

^a ZHEJIANG UNIVERSITY   (China)

^b NANCHANG UNIVERSITY   (China)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

Bin packing; Nash equilibrium; Price of anarchy

Indexed keywords

BIN PACKING; IN-BETWEEN; NASH EQUILIBRIUM; POLYNOMIAL-TIME; PRICE OF ANARCHY; SELFISH AGENTS; SOCIAL COSTS;

COSTS; GAME THEORY; INTERNET; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; WINE;

BINS;

EID: 58849086706     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_50     Document Type: Conference Paper

References (15)

1. Bilò, V.: On the packing of Selfish Items. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS), pp. 25-29 (2006)
2. Caprara, A., Pferschy, U.: Worst-case anaysis of the subset sum algorithm for bin packing. Operations Research letters 32, 159-166 (2004)
3. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D.S. (ed.) Approximation algorithms for NP-hard problems, PWS (1996)
4. Czumaj, A., Vocking, B.: Tight bound for the worst case equilibria. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA), pp. 413-420 (2002)
5. de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349-355 (1981)
6. Dósa, G.: The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ (11/9)OPT(I) +6/9. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 1-11. Springer, Heidelberg (2007)
7. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibria. In: Baeten, J.CM., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502-513. Springer, Heidelberg (2003)
8. Feldmann, R., Gairing, M., Lucking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 514-526. Springer, Heidelberg (2003)
9. Fotakis, D.A., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: The structure and complexity of nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123-134. Springer, Heidelberg (2002)
10. Johnson, D.S.: Near-optimal bin packing algorithms. PhD thesis. MIT, Cambridge, MA (1973)
11. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual IEEE Symposium on Foundation of Computer Science (FOCS), pp. 312-320 (1982)
12. Kousoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. In: Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 223-235 (2002)
13. Koutsoupias, E., Papadimitriou, C.: Worst-case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 387-396. Springer, Heidelberg (1999)
14. Mavronicolas, M., Sirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 510-519 (2001)
15. Nash, J.F.: Non-cooperative games. Annals of Mathematics 54, 28-295 (1951)