= Solution
Before using <no-waste allocation> to restrict the <constraint domains>, there is one <constraint graph> <vertex> for each of $A,B,C,D,E$. Every distinct pair has a disjointness <binary constraint>, and also the two directional <envy-free allocation> constraints. Thus the <constraint graph> is \b[the <complete graph> $K_5$], with all ten <edges>.
The nonempty-bundle and <no-waste allocation> requirements are unary and add no <edges>. The original all-item coverage constraint has been removed because this variant permits unallocated items.
\Image[/past-exam-of-the-computer-science-course-of-the-university-of-oxford/2023/artificial-intelligence-full-constraints.png]
{title=The allocation <constraint graph> before restricting the <constraint domains>}
Back to article page
