A Uniform Bound on Optimal Strategy Length in Water Transport Problem

Abstract: We prove that every water transport problem on an $n$-vertex graph has an optimal strategy of length at most $n<sup>{(2+o(1))n}$. More strongly, the convex hull of all strategy operators stabilizes within the same bound. We also give a five-vertex instance in which every optimal strategy repeats a nontrivial connected averaging set.