| Article ID: | iaor20171830 |
| Volume: | 15 |
| Issue: | 2 |
| Start Page Number: | 183 |
| End Page Number: | 199 |
| Publication Date: | Jun 2017 |
| Journal: | 4OR |
| Authors: | Gabay Michal |
| Keywords: | game theory, scheduling, heuristics |
We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi‐online packing or scheduling problem.