Preprint
Sep 2026
Faster Verification of PJR$^+$ via Mincuts
It is demonstrated how to compute the largest value of $\alpha$ for which a committee still fails the axiom using this mincut formulation, and a direct mincut formulation of the problem on a bipartite graph is given.
Drew Springham
· 0 citations