A new lower bound on the price of anarchy of selfish bin packing

DOI10.1016/j.ipl.2019.06.002zbMath1460.91052OpenAlexW2951304930MaRDI QIDQ2274500

Leah Epstein, György Dósa

Publication date: 20 September 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.06.002

zbMATH Keywords

combinatorial problemsbin packingprice of anarchy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial games (91A46)

Related Items (5)

Selfish bin packing under harmonic mean cost sharing mechanism ⋮ Selfish bin packing with punishment ⋮ Selfish vector packing ⋮ Selfish colorful bin packing games ⋮ Selfish bin packing with parameterized punishment

Cites Work

• Unnamed Item
• Parametric packing of selfish items and the subset sum algorithm
• Selfish bin packing with cardinality constraints
• Selfish bin packing
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• A note on a selfish bin packing problem

This page was built for publication: A new lower bound on the price of anarchy of selfish bin packing