A General Bin Packing Game: Interest Taken into Account

In this paper we study a general bin packing game with an interest matrix, which is a generalization of all the currently known bin packing games. In this game, there are some items with positive sizes and identical bins with unit capacity as in the classical bin packing problem; additionally we are given an interest matrix with rational entries, whose element $$a_{ij}$$ a i j stands for how much item i likes item j. The payoff of item i is the sum of $${a_{ij}}$$ a i j over all items j in the same bin with item i, and each item wants to stay in a bin where it can fit and its payoff is maximized. We find that if the matrix is symmetric, a Nash Equilibrium (NE) always exists. However the Price of Anarchy (PoA) may be very large, therefore we consider several special cases and give bounds for PoA. We present some results for the asymmetric case, too. Moreover we introduce a new metric, called the Price of Harmony (PoH for short), which we think is more accurate to describe the quality of an NE in the new model