Partitioning general probability measures (Q579730): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:43, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitioning general probability measures |
scientific article |
Statements
Partitioning general probability measures (English)
0 references
1987
0 references
Consider n probability measures \(\mu_ 1,...,\mu_ n\) on the same measurable space. It is the aim to split the whole sample set \(\Omega\) into n measurable parts \(A_ 1,...,A_ n\) such that \(A_ j\) has nearly the same probability for each distribution. Here the author considers the case when the atoms have not too large mass. Bounds for the accuracy of the partitions are derived. In the classical situation it is known that for nonatomic distributions there exists a partition with \(\mu_ j(A_ i)=1/n\) for each i and j. The problem and the solution is connected with famous names as Fisher, Neyman, Steinhaus, Banach, Dvoretzky, Wald, Wolfowitz, Dubins and others.
0 references
optimal-partitioning inequalities
0 references
atomic probability measures
0 references
cake- cutting
0 references
fair division problems
0 references
minimax decision rules
0 references
Bounds for the accuracy of the partitions
0 references