Partitioning general probability measures
From MaRDI portal
Recommendations
- 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
Cited in
(23)- Fairly taking turns
- Random probability measures with given mean and variance
- Stochastic partitions of sub-\(\sigma\)-fields of a probability measure space
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Sets on which several measures agree
- Maximin share and minimax envy in fair-division problems.
- Partitioning Bernoulli Populations with Respect to a Control
- A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures
- scientific article; zbMATH DE number 4078475 (Why is no real title available?)
- On maximin share allocations in matroids
- On the Yao-Yao partition theorem
- Modeling the processes of differentiation and integration
- A Proportionality Principle for Partitioning Problems
- scientific article; zbMATH DE number 4058668 (Why is no real title available?)
- Real partitions of measure spaces
- A sharp nonconvexity bound for partition ranges of vector measures with atoms
- Optimal-Partitioning Inequalities for Nonatomic Probability Measures
- Partitioning some multivariate distributions
- Partly divisible probability distributions
- On totally balanced games arising from cooperation in fair division
- A protocol for cutting matroids like cakes
- Equipartitioning common domains of non-atomic measures
- Equitable distribution of indivisible objects
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)
