# Fair distribution of bundles

arXiv: https://arxiv.org/abs/2507.13421 · HTML: https://mlsanity.com/paper/2507.13421/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Jul 2025.

## Built on by (most cited first, 1 of 1)

- [Ultracoarse Equilibria and Ordinal-Folding Dynamics in Operator-Algebraic Models of Infinite Multi-Agent Games](https://mlsanity.com/paper/2507.19694/) (2025)

## Abstract (arXiv)

In this paper, we study the problem of splitting fairly bundles of items. We show that given n bundles with m kinds of items in them, it is possible to distribute the value of each kind of item fairly among r persons by breaking apart at most (r-1)m bundles. Moreover, we can guarantee that each participant will receive roughly n/r - mr/2 full bundles. The proof methods are topological and use a modified form of the configuration space/test map scheme. We obtain optimal results when r is a power of two.