This is the authors' abstract. We don't add key points for this paper.
We consider the problem of finding the optimal upper bound for the tail of a sum of k nonnegative, independent and identically random variables with given mean x. For $k=1$ the answer is given Markov's inequality and for $k=2$ the solution was found by Hoeffding and in 1955. We solve the problem for $k=3$ as well as for general k x\≤1/(2k-1) by showing that it follows from the fractional version of extremal graph theory problem of Erd\{o}s on matchings in hypergraphs.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Łuczak et al. (2016) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: