Publisher
Springer International Publishing
Reference24 articles.
1. Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Luce, R.D., Tucker, A.W. (eds.) Contribution to the Theory of Game IV, Annals of Mathematical Study, vol. 40, pp. 287–324. University Press (1959)
2. Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. http://arxiv.org/abs/1708.03228 (2017)
3. Lecture Notes in Computer Science;J Balogh,2011
4. Bilò, V.: On the packing of selfish items. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium, pp. 9–18. IEEE (2006)
5. Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey, chap. 2. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, pp. 46–93. PWS (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Prices of Anarchy of Selfish 2D Bin Packing Games;International Journal of Foundations of Computer Science;2019-04