Funder
IBM Hungary
National Research, Development and Innovation Office – NKFIH
Széchenyi 2020
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference29 articles.
1. Worst-case performance bounds for simple one-dimensional packing algorithms;Johnson;SIAM J. Comput.,1974
2. Performance guarantees for one-dimensional bin packing;Csirik,2018
3. Strong equilibrium in congestion games;Holzman;Games Econom. Behav.,1997
4. Strong price of anarchy;Andelman;Games Econom. Behav.,2009
5. Selfish bin packing;Epstein;Algorithmica,2011
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Selfish bin packing with punishment;Theoretical Computer Science;2024-01
2. Selfish Vector Packing;Algorithmica;2021-07-01