Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914165393719296 |
|---|---|
| author | Dinitz, Michael Fineman, Jeremy T. Umboh, Seeun William |
| author_facet | Dinitz, Michael Fineman, Jeremy T. Umboh, Seeun William |
| contents | This paper considers using predictions in the context of the online Joint Replenishment Problem with Deadlines (JRP-D). Prior work includes asymptotically optimal competitive ratios of $O(1)$ for the clairvoyant setting and $O(\sqrt{n})$ of the nonclairvoyant setting, where $n$ is the number of items. The goal of this paper is to significantly reduce the competitive ratio for the nonclairvoyant case by leveraging predictions: when a request arrives, the true deadline of the request is not revealed, but the algorithm is given a predicted deadline.
The main result is an algorithm whose competitive ratio is $O(\min(η^{1/3}\log^{2/3}(n), \sqrtη, \sqrt{n}))$, where $n$ is the number of item types and $η\leq n^2$ quantifies how flawed the predictions are in terms of the number of ``instantaneous item inversions.'' Thus, the algorithm is robust, i.e., it is never worse than the nonclairvoyant solution, and it is consistent, i.e., if the predictions exhibit no inversions, then the algorithm behaves similarly to the clairvoyant algorithm. Moreover, if the error is not too large, specifically $η< o(n^{3/2}/\log^2(n))$, then the algorithm obtains an asymptotically better competitive ratio than the nonclairvoyant algorithm. We also show that all deterministic algorithms falling in a certain reasonable class of algorithms have a competitive ratio of $Ω(η^{1/3})$, so this algorithm is nearly the best possible with respect to this error metric. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_16094 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines Dinitz, Michael Fineman, Jeremy T. Umboh, Seeun William Data Structures and Algorithms This paper considers using predictions in the context of the online Joint Replenishment Problem with Deadlines (JRP-D). Prior work includes asymptotically optimal competitive ratios of $O(1)$ for the clairvoyant setting and $O(\sqrt{n})$ of the nonclairvoyant setting, where $n$ is the number of items. The goal of this paper is to significantly reduce the competitive ratio for the nonclairvoyant case by leveraging predictions: when a request arrives, the true deadline of the request is not revealed, but the algorithm is given a predicted deadline. The main result is an algorithm whose competitive ratio is $O(\min(η^{1/3}\log^{2/3}(n), \sqrtη, \sqrt{n}))$, where $n$ is the number of item types and $η\leq n^2$ quantifies how flawed the predictions are in terms of the number of ``instantaneous item inversions.'' Thus, the algorithm is robust, i.e., it is never worse than the nonclairvoyant solution, and it is consistent, i.e., if the predictions exhibit no inversions, then the algorithm behaves similarly to the clairvoyant algorithm. Moreover, if the error is not too large, specifically $η< o(n^{3/2}/\log^2(n))$, then the algorithm obtains an asymptotically better competitive ratio than the nonclairvoyant algorithm. We also show that all deterministic algorithms falling in a certain reasonable class of algorithms have a competitive ratio of $Ω(η^{1/3})$, so this algorithm is nearly the best possible with respect to this error metric. |
| title | Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2511.16094 |