Brief Announcement: On the Fair Subset Sum Problem
This work considers a fair allocation problem, called the Fair Subset Sum problem (FSSP), where a common and bounded resource is to be shared among two agents A and B. Each agent is willing to select a set of items from an available ground set of weighted items. We address two types of items structure. In the Separate Items case, each agent owns a set of items having nonnegative weights and each agent can only use its own items. In the Shared Items case the agents select the items from the same ground set.