The Convergence Time for Selfish Bin Packing
In classic bin packing, the objective is to partition a set of n items with positive rational sizes in (0,1] into a minimum number of subsets called bins, such that the total size of the items of each bin at most 1. We study a bin packing game where the cost of each bin is 1, and given a valid packing of the items, each item has a cost associated with it, such that the items that are packed into a bin share its cost equally. We find tight bounds on the exact worst-case number of steps in processes of convergence to pure Nash equilibria. Those are processes that are given an arbitrary packing. As long as there exists an item that can reduce its cost by moving from its bin to another bin, in each step, a controller selects such an item and instructs it to perform such a beneficial move. The process terminates when no further beneficial moves exist. The function of n that we find is Θ(n 3/2), improving the previous bound of Han et al., who showed an upper bound of O(n 2).
KeywordsNash Equilibrium Small Step Convergence Time Good Number Congestion Game
Unable to display preview. Download preview PDF.
- 1.Adar, R., Epstein, L.: Selfish bin packing with cardinality constraints. Theoretical Computer Science (to appear, 2013)Google Scholar
- 2.Bilò, V.: On the packing of selfish items. In: Proc. of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 9 pages. IEEE (2006)Google Scholar
- 3.Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms. PWS Publishing Company (1997)Google Scholar
- 4.Coffman Jr., E., Csirik, J.: Performance guarantees for one-dimensional bin packing. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch. 32, pp. 32-1–32-18. Chapman & Hall/CRC (2007)Google Scholar
- 5.Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147–177 (1998)Google Scholar
- 6.Dósa, G., Epstein, L.: Generalized selfish bin packing (2012) (Manuscript)Google Scholar
- 14.Ieong, S., McGrew, B., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proceedings of the 20th National Conference on Artificial Intelligence, pp. 489–494 (2005)Google Scholar