Partitioning general probability measures
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.
- Optimal-Partitioning Inequalities for Nonatomic Probability Measures
- A Proportionality Principle for Partitioning Problems
- A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
- Equipartitioning common domains of non-atomic measures
- Optimal Partitioning of a Measurable Space
- On the Yao-Yao partition theorem
- Stochastic partitions of sub--fields of a probability measure space
- A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
- Sets on which several measures agree
- Equitable distribution of indivisible objects
- On totally balanced games arising from cooperation in fair division
- A sharp nonconvexity bound for partition ranges of vector measures with atoms
- Maximin share and minimax envy in fair-division problems.
- On maximin share allocations in matroids
- Random probability measures with given mean and variance
- Modeling the processes of differentiation and integration
- Real partitions of measure spaces
- Partitioning some multivariate distributions
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- A protocol for cutting matroids like cakes
- Partitioning Bernoulli Populations with Respect to a Control
- Optimal-Partitioning Inequalities for Nonatomic Probability Measures
- A Proportionality Principle for Partitioning Problems
- scientific article; zbMATH DE number 4058668 (Why is no real title available?)
- scientific article; zbMATH DE number 4078475 (Why is no real title available?)
- Partly divisible probability distributions
- Fairly taking turns
- Worst-case fair guarantees when spending a common budget
- Approximating proportional and maximin allocations on d-claw-free graphs
- Approximation schemes for k-subset sum ratio and k-way number partitioning ratio
- Equipartitioning common domains of non-atomic measures
This page was built for publication: Partitioning general probability measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579730)
