Bin Packing Games with Selfish Items

Abstract We discuss recent work on the subject of selfish bin packing. In these problems, items are packed into bins, such that each item wishes to minimize its own payoff. We survey the known results for a number of variants, focusing on worst-case Nash equilibria and other kinds of equilibria, and mentioning several results regarding issues of complexity and convergence to equilibria.

Authors

• Leah Epstein

Keywords

No keywords are indexed for this paper.