Using weight decision for decreasing the price of anarchy in selfish bin packing games
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[2] Jirí Sgall,et al. Optimal Analysis of Best Fit Bin Packing , 2014, ICALP.
[3] Vittorio Bilò. On the packing of selfish items , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[4] Daniele Vigo,et al. Bin packing approximation algorithms: Survey and classification , 2013 .
[5] Zsolt Tuza,et al. Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy , 2018, WAOA.
[6] Jirí Sgall,et al. First Fit bin packing: A tight analysis , 2013, STACS.
[7] Xin Chen,et al. An Improved Mechanism for Selfish Bin Packing , 2017, COCOA.
[8] Guochuan Zhang,et al. Cost-Sharing Mechanisms for Selfish Bin Packing , 2017, COCOA.
[9] Guochuan Zhang,et al. Bin Packing of Selfish Items , 2008, WINE.
[10] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[11] Leah Epstein,et al. Parametric Packing of Selfish Items and the Subset Sum Algorithm , 2014, Algorithmica.
[12] Zsolt Tuza,et al. A General Bin Packing Game: Interest Taken into Account , 2017, Algorithmica.
[13] Leah Epstein,et al. Selfish Bin Packing , 2008, Algorithmica.
[14] Deshi Ye,et al. A note on a selfish bin packing problem , 2013, J. Glob. Optim..
[15] T. C. Edwin Cheng,et al. Bin packing game with a price of anarchy of $$\frac{3}{2}$$32 , 2018, J. Comb. Optim..