Online Two-Dimensional Vector Packing with Advice
Bengt J. Nilsson, Gordana Vujovic

TL;DR
This paper studies the online two-dimensional vector packing problem, establishing bounds on competitive ratios for strategies with advice, and introduces new strategies with improved ratios for specific vector angle ranges.
Contribution
It provides new strategies with competitive ratios for vector packing with advice, including bounds for restricted angles and an improved ratio for unrestricted vectors.
Findings
Lower bound of 11/5 on competitive ratio for any { extsc{AnyFit}} strategy.
Strategies with competitive ratio depending on vector angles and advice.
A 5/2-competitive strategy for unrestricted vectors.
Abstract
We consider the online two-dimensional vector packing problem, showing a lower bound of on the competitive ratio of any {\sc AnyFit} strategy for the problem. We provide strategies with competitive ratio and logarithmic advice, for any instance where all the input vectors are restricted to have angles in the range , for and and logarithmic advice, for any instance where all the input vectors are restricted to have angles in the range , for . In addition, we give a -competitive strategy also using logarithmic advice for the unrestricted vectors case. These results should be contrasted to the currently best competitive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Optimization and Packing Problems · Auction Theory and Applications
