Improved Semi-Parametric Bounds for Tail Probability and Expected Loss: Theory and Applications

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Li, Zhaolin, Prokhorov, Artem
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916736213712896
author Li, Zhaolin
Prokhorov, Artem
author_facet Li, Zhaolin
Prokhorov, Artem
contents Many management decisions involve accumulated random realizations for which only the first and second moments of their distribution are available. The sharp Chebyshev-type bound for the tail probability and Scarf bound for the expected loss are widely used in this setting. We revisit the tail behavior of such quantities with a focus on independence. Conventional primal-dual approaches from optimization are ineffective in this setting. Instead, we use probabilistic inequalities to derive new bounds and offer new insights. For non-identical distributions attaining the tail probability bounds, we show that the extreme values are equidistant regardless of the distributional differences. For the bound on the expected loss, we show that the impact of each random variable on the expected sum can be isolated using an extension of the Korkine identity. We illustrate how these new results open up abundant practical applications, including improved pricing of product bundles, more precise option pricing, more efficient insurance design, and better inventory management. For example, we establish a new solution to the optimal bundling problem, yielding a 17% uplift in per-bundle profits, and a new solution to the inventory problem, yielding a 5.6% cost reduction for a model with 20 retailers.
format Preprint
id arxiv_https___arxiv_org_abs_2404_02400
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Improved Semi-Parametric Bounds for Tail Probability and Expected Loss: Theory and Applications
Li, Zhaolin
Prokhorov, Artem
Econometrics
Methodology
Other Statistics
Many management decisions involve accumulated random realizations for which only the first and second moments of their distribution are available. The sharp Chebyshev-type bound for the tail probability and Scarf bound for the expected loss are widely used in this setting. We revisit the tail behavior of such quantities with a focus on independence. Conventional primal-dual approaches from optimization are ineffective in this setting. Instead, we use probabilistic inequalities to derive new bounds and offer new insights. For non-identical distributions attaining the tail probability bounds, we show that the extreme values are equidistant regardless of the distributional differences. For the bound on the expected loss, we show that the impact of each random variable on the expected sum can be isolated using an extension of the Korkine identity. We illustrate how these new results open up abundant practical applications, including improved pricing of product bundles, more precise option pricing, more efficient insurance design, and better inventory management. For example, we establish a new solution to the optimal bundling problem, yielding a 17% uplift in per-bundle profits, and a new solution to the inventory problem, yielding a 5.6% cost reduction for a model with 20 retailers.
title Improved Semi-Parametric Bounds for Tail Probability and Expected Loss: Theory and Applications
topic Econometrics
Methodology
Other Statistics
url https://arxiv.org/abs/2404.02400