Abstract
Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is 1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.
| Original language | English |
|---|---|
| Pages (from-to) | 827-847 |
| Number of pages | 21 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 37 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Apr 2019 |
Bibliographical note
Publisher Copyright:© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Bin packing
- Nash equilibrium
- Pareto optimality
- Selfish players
ASJC Scopus subject areas
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics