scientific article; zbMATH DE number 1417714

zbMATH Open0966.91012MaRDI QIDQ4944178FDOQ4944178

Authors: Frits C. R. Spieksma, Gerhard J. Woeginger 

Publication date: 19 March 2000

Title of this publication is not available (Why is that?)

Recommendations

• Complexity of core allocation for the bin packing game
• Selfish bin coloring
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Bin packing games with selfish items
• Bin packing games

zbMATH Keywords

polynomial time results

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Combinatorial games (91A46)

Cited In (5)

• Complexity of core allocation for the bin packing game
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• The subset sum game revisited
• The subset sum game revisited
• The computational complexity of Angry Birds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944178)