Prophet Inequalities over Time
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908520339734528 |
|---|---|
| author | Abels, Andreas Pitschmann, Elias Schmand, Daniel |
| author_facet | Abels, Andreas Pitschmann, Elias Schmand, Daniel |
| contents | In this paper, we introduce an over-time variant of the well-known prophet inequality with i.i.d. random variables. Instead of stopping with one realized value at some point in the process, we decide for each step how long we select the value. Then we cannot select another value until this period is over. The goal is to maximize the expectation of the sum of selected values. We describe the structure of the optimal stopping rule and give upper and lower bounds on the prophet inequality. In online algorithms terminology, this corresponds to bounds on the competitive ratio of an online algorithm.
We give a surprisingly simple algorithm with a single threshold that results in a prophet inequality of $\approx 0.396$ for all input lengths $n$. Additionally, as our main result, we present a more advanced algorithm resulting in a prophet inequality of $\approx 0.598$ when the number of steps tends to infinity. We complement our results by an upper bound that shows that the best possible prophet inequality is at most $1/φ\approx 0.618$, where $φ$ denotes the golden ratio. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_10471 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Prophet Inequalities over Time Abels, Andreas Pitschmann, Elias Schmand, Daniel Data Structures and Algorithms In this paper, we introduce an over-time variant of the well-known prophet inequality with i.i.d. random variables. Instead of stopping with one realized value at some point in the process, we decide for each step how long we select the value. Then we cannot select another value until this period is over. The goal is to maximize the expectation of the sum of selected values. We describe the structure of the optimal stopping rule and give upper and lower bounds on the prophet inequality. In online algorithms terminology, this corresponds to bounds on the competitive ratio of an online algorithm. We give a surprisingly simple algorithm with a single threshold that results in a prophet inequality of $\approx 0.396$ for all input lengths $n$. Additionally, as our main result, we present a more advanced algorithm resulting in a prophet inequality of $\approx 0.598$ when the number of steps tends to infinity. We complement our results by an upper bound that shows that the best possible prophet inequality is at most $1/φ\approx 0.618$, where $φ$ denotes the golden ratio. |
| title | Prophet Inequalities over Time |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2211.10471 |