Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916098815819776 |
|---|---|
| author | Plank, Benedikt M. Schewior, Kevin |
| author_facet | Plank, Benedikt M. Schewior, Kevin |
| contents | We revisit the Stochastic Score Classification (SSC) problem introduced by Gkenosis et al. (ESA 2018): We are given $n$ tests. Each test $j$ can be conducted at cost $c_j$, and it succeeds independently with probability $p_j$. Further, a partition of the (integer) interval $\{0,\dots,n\}$ into $B$ smaller intervals is known. The goal is to conduct tests so as to determine that interval from the partition in which the number of successful tests lies while minimizing the expected cost. Ghuge et al. (IPCO 2022) recently showed that a polynomial-time constant-factor approximation algorithm exists.
We show that interweaving the two strategies that order tests increasingly by their $c_j/p_j$ and $c_j/(1-p_j)$ ratios, respectively, -- as already proposed by Gkensosis et al. for a special case -- yields a small approximation ratio. We also show that the approximation ratio can be slightly decreased from $6$ to $3+2\sqrt{2}\approx 5.828$ by adding in a third strategy that simply orders tests increasingly by their costs. The similar analyses for both algorithms are nontrivial but arguably clean. Finally, we complement the implied upper bound of $3+2\sqrt{2}$ on the adaptivity gap with a lower bound of $3/2$. Since the lower-bound instance is a so-called unit-cost $k$-of-$n$ instance, we settle the adaptivity gap in this case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_14082 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios Plank, Benedikt M. Schewior, Kevin Data Structures and Algorithms We revisit the Stochastic Score Classification (SSC) problem introduced by Gkenosis et al. (ESA 2018): We are given $n$ tests. Each test $j$ can be conducted at cost $c_j$, and it succeeds independently with probability $p_j$. Further, a partition of the (integer) interval $\{0,\dots,n\}$ into $B$ smaller intervals is known. The goal is to conduct tests so as to determine that interval from the partition in which the number of successful tests lies while minimizing the expected cost. Ghuge et al. (IPCO 2022) recently showed that a polynomial-time constant-factor approximation algorithm exists. We show that interweaving the two strategies that order tests increasingly by their $c_j/p_j$ and $c_j/(1-p_j)$ ratios, respectively, -- as already proposed by Gkensosis et al. for a special case -- yields a small approximation ratio. We also show that the approximation ratio can be slightly decreased from $6$ to $3+2\sqrt{2}\approx 5.828$ by adding in a third strategy that simply orders tests increasingly by their costs. The similar analyses for both algorithms are nontrivial but arguably clean. Finally, we complement the implied upper bound of $3+2\sqrt{2}$ on the adaptivity gap with a lower bound of $3/2$. Since the lower-bound instance is a so-called unit-cost $k$-of-$n$ instance, we settle the adaptivity gap in this case. |
| title | Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2211.14082 |