Convergence Time to Nash Equilibrium in Selfish Bin Packing

We consider a game-theoretic bin packing problem and we study the convergence time to a Nash equilibrium. We show that, if the best-response strategy is used, then the number of steps needed to reach Nash equilibrium is O ( m w max 2 + n w max ) and O ( n k w max ) , where n, m, k and w max denotes, resp., the number of items, the number of bins, the number of distinct item sizes, and the size of a largest item.