P

Initializing...

Theorem 9 — greedy round-robin gives every agent at least (2 − 1/N)·MmS on chores, and the factor cannot be improved · Prove2Me