A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
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_ | 1866911066662895616 |
|---|---|
| author | Kang, Suho Liu, Ziyang Udwani, Rajan |
| author_facet | Kang, Suho Liu, Ziyang Udwani, Rajan |
| contents | In a typical online resource allocation problem, we start with a fixed inventory of resources and make online allocation decisions in response to resource requests that arrive sequentially over a finite horizon. We consider settings where the inventory is replenished over time according to an unknown exogenous process. We introduce black-box methods that extend any existing algorithm, originally designed without considering replenishment, into one that works with an arbitrary (adversarial or stochastic) replenishment process. Our approach preserves the original algorithm's competitive ratio in regimes with large initial inventory, thereby enabling the seamless integration of exogenous replenishment into a large body of existing algorithmic results for both adversarial and stochastic arrival models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_14812 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation Kang, Suho Liu, Ziyang Udwani, Rajan Data Structures and Algorithms In a typical online resource allocation problem, we start with a fixed inventory of resources and make online allocation decisions in response to resource requests that arrive sequentially over a finite horizon. We consider settings where the inventory is replenished over time according to an unknown exogenous process. We introduce black-box methods that extend any existing algorithm, originally designed without considering replenishment, into one that works with an arbitrary (adversarial or stochastic) replenishment process. Our approach preserves the original algorithm's competitive ratio in regimes with large initial inventory, thereby enabling the seamless integration of exogenous replenishment into a large body of existing algorithmic results for both adversarial and stochastic arrival models. |
| title | A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2507.14812 |