On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
This paper resolves a key open question from Gorantla et al. by deriving explicit upper bounds on the number of item copies required to guarantee envy-free allocations for arbitrary numbers of agent groups and item types, using a novel constructive technique that extends to both chores and continuous fair division settings.