Bin packing game with an interest matrix

Zhenbo Wang, Xin Han, G. Dósa, Z. Tuza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper we study a game problem, called 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 aij stands for how much item i likes item j. The payoff of item i is the sum of aij 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 pure Nash Equilibrium always exists. However the PoA (Price of Anarchy) may be very large, therefore we consider several special cases and give bounds for PoA in them. We present some results for the asymmetric case, too.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages57-69
Number of pages13
Volume9198
ISBN (Print)9783319213972
DOIs
Publication statusPublished - 2015
Event21st International Conference on Computing and Combinatorics Conference, COCOON 2015 - Beijing, China
Duration: Aug 4 2015Aug 6 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9198
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st International Conference on Computing and Combinatorics Conference, COCOON 2015
CountryChina
CityBeijing
Period8/4/158/6/15

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Wang, Z., Han, X., Dósa, G., & Tuza, Z. (2015). Bin packing game with an interest matrix. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9198, pp. 57-69). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9198). Springer Verlag. https://doi.org/10.1007/978-3-319-21398-9_5