Bin packing game with a price of anarchy of \(\frac{3}{2}\) (Q1702843): Difference between revisions

@@ Property / cites work @@
+The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Q2957914
@@ Property / cites work: Q2957914 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin Packing Games with Selfish Items
@@ Property / cites work: Bin Packing Games with Selfish Items / rank @@
+Normal rank
@@ Property / cites work @@
+Selfish bin packing
@@ Property / cites work: Selfish bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric packing of selfish items and the subset sum algorithm
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+A note on a selfish bin packing problem
@@ Property / cites work: A note on a selfish bin packing problem / rank @@
+Normal rank