Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems

From MaRDI portal
Publication:4127811

DOI10.2307/2285843zbMath0356.62054OpenAlexW4248821906MaRDI QIDQ4127811

Seymour M. Kwerel

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2285843




Related Items (max. 100)

New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributionsOn the relationship between the discrete and continuous bounding moment problems and their numerical solutionsOn inequalities for probabilities of unions of events and the Borel-Cantelli lemmaNumerical evaluation of singular multivariate normal distributionsTighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programsMean time to failure of systems with dependent componentsThe truncated moment problem on \(\mathbb{N}_0\)On estimation of probabilities of unions of events with applications to the Borel-Cantelli lemmaOn inequalities for values of first jumps of distribution functions and Hölder's inequalitySharp probability bounds for the binomial moment problem with symmetryTight Probability Bounds with Pairwise IndependenceComputing bounds for the probability of the union of events by different methodsMonge properties, discrete convexity and applicationsScharfe untere und obere Schranken für die Wahrscheinlichkeit der Realisation von k unter n EreignissenApproximate inclusion-exclusionOn the probability of union in the $n$-spaceOn upper and lower bounds for probabilities of combinations of eventsA new method for generating Bonferroni-type inequalities by iterationDeterministic approximations of probability inequalitiesFréchet optimal bounds on the probability of a union with supplementary informationUpper and lower bounds for the probability that r events occurBivariate Bonferroni inequalitiesBonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n\)] ⋮ Bounding the probability of the union of events by aggregation and disaggregation in linear programsBounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilitiesBounds and approximations for pairwise comparisons of independent multinormal meansBonferroni-type inequalities for conditional scan statisticsImproved bounds on the probability of the union of events some of whose intersections are emptyBounds for the probability of union of events following monotonic distributionThe maximal probability that k‐wise independent bits are all 1On inequalities for probabilities wherein at least \(r\) from \(n\) events occurOn inequalities for probabilities of joint occurrence of several eventsSharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are knownApproximating two-stage chance-constrained programs with classical probability boundsPolynomially Computable Bounds for the Probability of the Union of EventsThe value of shape constraints in discrete moment problems: a review and extensionOptimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraintsIterating Bonferroni boundsA modified Benjamini-Hochberg multiple comparisons procedure for controlling the false discovery rate




This page was built for publication: Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems