A General Bin Packing Game: Interest Taken into Account
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. The performance of a memory allocation algorithm , 1971 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[4] Daniele Vigo,et al. Bin packing approximation algorithms: Survey and classification , 2013 .
[5] Jirí Sgall,et al. Optimal Analysis of Best Fit Bin Packing , 2014, ICALP.
[6] Jirí Sgall,et al. First Fit bin packing: A tight analysis , 2013, STACS.
[7] Leah Epstein,et al. Selfish Bin Packing , 2008, Algorithmica.
[8] Leah Epstein,et al. The Convergence Time for Selfish Bin Packing , 2018, Acta Cybern..
[9] Guochuan Zhang,et al. Bin Packing of Selfish Items , 2008, WINE.
[10] Vittorio Bilò. On the packing of selfish items , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[11] Deshi Ye,et al. A note on a selfish bin packing problem , 2013, J. Glob. Optim..
[12] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.