Proof of Theorem 4.10 — with $k \ge n^2$ tasks some agent receives at least $n$ tasks

Initializing...

Proof of Theorem 4.10 — with $k \ge n^2$ tasks some agent receives at least $n$ tasks · Prove2Me