Maximum Flow is Fair: A Network Flow Approach to Committee Voting

In the committee voting setting, a subset of k alternatives is selected based on the preferences of voters. In this paper, our goal is to efficiently compute textitex-ante fair probability distributions over committees. We introduce a new axiom called textitgroup resource proportionality, which strengthens other fairness notions in the literature. We characterize our fairness axiom by a correspondence with max flows on a network formulation of committee voting. Using the connection to flow networks revealed by this characterization, we introduce two voting rules which achieve fairness in conjunction with other desiderata. The first rule - the textitredistributive utilitarian rule - satisfies ex-ante efficiency in addition to our fairness axiom. The second rule - Generalized CUT - reduces instances of our problem to instances of the minimum-cost maximum flow problem. We show that Generalized CUT maximizes social welfare subject to our fairness axiom and additionally satisfies an incentive compatibility property known as textitexcludable strategyproofness. Lastly, we show our fairness property can be obtained in tandem with strong textitex-post fairness properties - an approach known as textitbest-of-both-worlds fairness. We strengthen existing best-or-both-worlds fairness results in committee voting and resolve an open question posed by Aziz et al. [2023].