Pareto optimal equilibria for selfish bin packing with uniform cost sharing

György Dósa, Leah Epstein

Research output: Contribution to journalArticle

1 Citation (Scopus)


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 (Formula presented.), 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 languageEnglish
Pages (from-to)1-21
Number of pages21
JournalJournal of Combinatorial Optimization
Publication statusAccepted/In press - Jun 30 2018



  • 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

Cite this