Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.03817 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912221958766592 |
|---|---|
| author | Wang, Yanzhao Sigaroudi, Hasti Nourmohammadi Sun, Bo Ardakanian, Omid Tan, Xiaoqi |
| author_facet | Wang, Yanzhao Sigaroudi, Hasti Nourmohammadi Sun, Bo Ardakanian, Omid Tan, Xiaoqi |
| contents | This paper investigates the online conversion problem, which involves sequentially trading a divisible resource (e.g., energy) under dynamically changing prices to maximize profit. A key challenge in online conversion is managing decisions under horizon uncertainty, where the duration of trading is either known, revealed partway, or entirely unknown. We propose a unified algorithm that achieves optimal competitive guarantees across these horizon models, accounting for practical constraints such as box constraints, which limit the maximum allowable trade per step. Additionally, we extend the algorithm to a learning-augmented version, leveraging horizon predictions to adaptively balance performance: achieving near-optimal results when predictions are accurate while maintaining strong guarantees when predictions are unreliable. These results advance the understanding of online conversion under various degrees of horizon uncertainty and provide more practical strategies to address real world constraints. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_03817 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty Wang, Yanzhao Sigaroudi, Hasti Nourmohammadi Sun, Bo Ardakanian, Omid Tan, Xiaoqi Data Structures and Algorithms Machine Learning This paper investigates the online conversion problem, which involves sequentially trading a divisible resource (e.g., energy) under dynamically changing prices to maximize profit. A key challenge in online conversion is managing decisions under horizon uncertainty, where the duration of trading is either known, revealed partway, or entirely unknown. We propose a unified algorithm that achieves optimal competitive guarantees across these horizon models, accounting for practical constraints such as box constraints, which limit the maximum allowable trade per step. Additionally, we extend the algorithm to a learning-augmented version, leveraging horizon predictions to adaptively balance performance: achieving near-optimal results when predictions are accurate while maintaining strong guarantees when predictions are unreliable. These results advance the understanding of online conversion under various degrees of horizon uncertainty and provide more practical strategies to address real world constraints. |
| title | Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty |
| topic | Data Structures and Algorithms Machine Learning |
| url | https://arxiv.org/abs/2502.03817 |