EUVIMEDEUVIMED entdecken
Crossref

Quality of equilibria for selfish bin packing with cost sharing variants

György Dósa, Leah Epstein

Discrete Optimization · 2020-11 · 38 · 100556

DOI: 10.1016/j.disopt.2019.100556 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Optimization, 2020-11. Verfasst von György Dósa und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 29 Literaturangaben. Gefördert von: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, International Business Machines Corporation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Bin packing is the problem of splitting a set of items into a minimum number of subsets, called bins, of total sizes no larger than 1, where a solution is called a packing. We study bin packing games where an item also has a positive weight, and given a valid packing of the items, each item has a cost associated with it, such that the cost of an item is the ratio between its weight and the total weight of items packed in its bin. That is, the cost sharing is based linearly on the weights of items. We study several types of Nash equilibria: pure Nash equilibria, strong equilibria, strictly Pareto optimal equilibria, and weakly Pareto optimal equilibria, and show that any game of this class of bin packing games admits all these types of equilibria. We study the (asymptotic) prices of anarchy and stability (POA and POS) of these games with respect to the four types of equilibria. We find that the problem is strongly related to the well-known First Fit algorithm, and all the four POA values are equal to 1.7. The POS values are shown to be equal to 1, except for strong equilibria, for which the POS value is 1.7. Additionally, we study the sub-class of bin packing games with equal weights, where the cost sharing of each bin is uniform in the sense that the cost of a bin is shared equally between its items. We analyze the price of anarchy, and find that this value is strictly smaller than 1.7 and in particular, it is not larger than 1.699396 and it is at least 1.69664.

Förderung

  • Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
  • International Business Machines Corporation

Zitieren

APA

Dósa, G., & Epstein, L. (2020). Quality of equilibria for selfish bin packing with cost sharing variants. Discrete Optimization, 38, 100556. https://doi.org/10.1016/j.disopt.2019.100556

Vancouver

Dósa G, Epstein L. Quality of equilibria for selfish bin packing with cost sharing variants. Discrete Optimization. 2020;38:100556. doi:10.1016/j.disopt.2019.100556

BibTeX
@article{Dsa2020,
  author = {Dósa, György and Epstein, Leah},
  title = {Quality of equilibria for selfish bin packing with cost sharing variants},
  journal = {Discrete Optimization},
  year = {2020},
  volume = {38},
  pages = {100556},
  doi = {10.1016/j.disopt.2019.100556}
}
Kostenlos starten →