The paper addresses the question of whether similar results on the existence of maximin share (MMS) allocations hold for the general mixed manna setting, where items can be either goods or chores.
The key insights are:
For n ≤ 3 agents, an MMS allocation exists as long as m ≤ n + 5, regardless of the types of agents (goods, chores, or mixed).
For instances with m ≤ n + 5 and either (i) only chores agents or (ii) at least one non-negative agent, an MMS allocation exists.
The techniques used to obtain the m ≤ n + 5 bound for goods do not apply to the mixed manna setting. The paper introduces new techniques, including modifying the utility functions of agents, to handle these settings.
The main challenge is dealing with instances that contain only negative mixed agents (agents that consider some items as goods and others as chores). Handling these instances remains an open problem.
На другой язык
из исходного контента
arxiv.org
Дополнительные вопросы