Before revision: In this work we add a graph theoretical perspective to a classical problemof fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph.
After revision: In this work we add a graph theoretical perspective to this classical problem. Thereby we introduce an incompatibility relation between pairs of items described in terms of a conflict graph.