Consensus Halving for Sets of Items: For n Agents with Additive Utilities a Consensus Halving That Cuts at Most min{n, m} of the m Items Always ExistsResearch Paper
Consensus halving asks for a division of a resource into two parts that every one of agents values equally, so that a group with heterogeneous preferences can agree that the two parts are of the same worth. The classical setting is a divisible interval (a cake or a necklace), where Simmons and Su (2003), building on Hobby and Rice (1965), showed that cut…