Bin packing game with a price of anarchy of $$\frac{3}{2}$$32
暂无分享,去创建一个
T. C. Edwin Cheng | Tao Sun | Qizhi Fang | Qingqin Nong | T. Cheng | Qizhi Fang | Q. Nong | T. Sun
[1] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[2] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.
[3] Guochuan Zhang,et al. Bin Packing of Selfish Items , 2008, WINE.
[4] Leah Epstein,et al. Selfish Bin Packing , 2008, Algorithmica.
[5] Jeffrey D. Ullman,et al. The performance of a memory allocation algorithm , 1971 .
[6] Vittorio Bilò. On the packing of selfish items , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[7] Deshi Ye,et al. A note on a selfish bin packing problem , 2013, J. Glob. Optim..
[8] Leah Epstein,et al. Parametric Packing of Selfish Items and the Subset Sum Algorithm , 2009, WINE.
[9] Leah Epstein,et al. Generalized selfish bin packing , 2012, ArXiv.
[10] Leah Epstein,et al. Bin Packing Games with Selfish Items , 2013, MFCS.
[11] Jirí Sgall,et al. First Fit bin packing: A tight analysis , 2013, STACS.