Ma, Ruixin; Dósa, György; Han, Xin; Ting, Hing-Fung; … - In: Journal of Global Optimization 56 (2013) 4, pp. 1457-1462
In this paper, we consider a selfish bin packing problem, where each item is a selfish player and wants to minimize its cost. In our new model, if there are k items packed in the same bin, then each item pays a cost 1/k, where k ≥ 1. First we find a Nash Equilibrium (NE) in time O(n log n)...
