The maximum number of winning 2-sets (Q1182325): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 14:57, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The maximum number of winning 2-sets |
scientific article |
Statements
The maximum number of winning 2-sets (English)
0 references
28 June 1992
0 references
In the winning \(t\)-set problem with parameters \(n,a,b,t\) we must choose nonnegative real numbers \(x_ 1,x_ 2,\dots,x_ n\) subject to \(x_ i\leq a\) and \(\Sigma x_ i=b\), so as to maximize the number of \(t\)-sets \(I\) having the property \(\sum_{i\in I}x_ i\geq 1\). For \(t=2\) the author provides a solution by characterizing potentially optimal configurations. For \(t>2\) he conjectures that it remains true that there is always an optimal solution with at most two distinct nonzero values. The winning \(t\)-set problem originated in a sampling without replacement setting and can be formulated probabilistically.
0 references
winning \(t\)-sets
0 references
sampling without replacement
0 references
bounded random variables
0 references