Author:
Li Weian,Fang Qizhi,Liu Wenjing
Publisher
Springer International Publishing
Reference15 articles.
1. Adar, R., Epstein, L.: Selfish bin packing with cardinality constraints. Theoret. Comput. Sci. 495, 66–80 (2013)
2. Assmann, S.B.: Problems in discrete applied mathematics. Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA (1983)
3. Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502–525 (1984)
4. Bilò, V.: On the packing of selfish items. In: Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, p. 9. IEEE (2006)
5. Cao, Z., Yang, X.: Selfish bin covering. Theoret. Comput. Sci. 412(50), 7049–7058 (2011)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Various Open-End Bin Packing Game;Combinatorial Optimization and Applications;2021
2. From packing rules to cost-sharing mechanisms;Journal of Combinatorial Optimization;2020-01-10
3. An improved mechanism for selfish bin packing;Journal of Combinatorial Optimization;2019-11-25
4. Cost-Sharing Mechanisms for Selfish Bin Packing;Combinatorial Optimization and Applications;2017
5. An Improved Mechanism for Selfish Bin Packing;Combinatorial Optimization and Applications;2017