Constructive Proofs of Generalized Boole--Frechet Bounds: A Dynamic Programming Approach
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908703391744000 |
|---|---|
| author | Salako, Kizito |
| author_facet | Salako, Kizito |
| contents | Extensions of the Boole--Frechet inequalities give sharp bounds for the probabilities of compound events, particularly when only the probabilities of atomic events (that make up the compound events) are known. We present a constructive approach to obtaining generalized Boole--Frechet bounds using dynamic programming. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_09161 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constructive Proofs of Generalized Boole--Frechet Bounds: A Dynamic Programming Approach Salako, Kizito Probability Primary 60E15, Secondary 60-08 Extensions of the Boole--Frechet inequalities give sharp bounds for the probabilities of compound events, particularly when only the probabilities of atomic events (that make up the compound events) are known. We present a constructive approach to obtaining generalized Boole--Frechet bounds using dynamic programming. |
| title | Constructive Proofs of Generalized Boole--Frechet Bounds: A Dynamic Programming Approach |
| topic | Probability Primary 60E15, Secondary 60-08 |
| url | https://arxiv.org/abs/2512.09161 |