We establish tight asymptotic bounds on the smallest integer p such that an MMS1-out-of-p allocation always exists when allocating indivisible items among groups of agents.
