Discussion Overview
The discussion revolves around finding upper and lower bounds for the expected value of the minimum of independent binomial random variables. Participants explore the theoretical challenges associated with directly computing this expected value and consider alternative approaches, including bounding techniques.
Discussion Character
- Exploratory
- Technical explanation
- Debate/contested
Main Points Raised
- One participant seeks recommendations for papers or books that provide bounds for E(min(X1,X2,...,Xn)), where Xi are independent binomial random variables.
- Another participant questions the need for bounds and suggests considering the direct computation of the expected value.
- A participant notes the lack of a closed formula for the cumulative distribution function (cdf) of the binomial distribution, indicating that this complicates the theoretical evaluation of the minimum.
- Another participant references a specific floor-sum expression related to the cdf of the binomial distribution, implying that there may be some existing formulations that could be relevant.
Areas of Agreement / Disagreement
Participants express differing views on the necessity of finding bounds versus computing the expected value directly. There is no consensus on the best approach to take, and the discussion remains unresolved regarding the most effective method for addressing the problem.
Contextual Notes
Participants highlight the absence of a closed formula for the cdf of the binomial distribution as a limitation in evaluating the expected value of the minimum. This suggests that assumptions about the feasibility of direct computation may need to be reconsidered.