Discrepancy And Fair Division For Non-Additive Valuations

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two applications of this result to problems in fair division. First, we establish a bound for a consensus halving problem, where fairness is measured by the minimum number of items that must be transferred between the two parts to eliminate envy. Second, we improve the upper bound on the total subsidy required to achieve an envy-free allocation when the number of agents is a prime power, obtaining an $O(n \sqrt{n \log n})$ bound. This constitutes the first known subquadratic guarantee in this setting.