71 citations · 106 across the 18 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2023
Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to guide Near-Optimal Cost-Recovery Algorithms
Sander Aarts, Jacob Dentes, Manxi Wu +1
We consider the problem of fairly allocating the cost of providing a service among a set of users, where the service cost is formulated by an NP-hard {\it covering integer program…
cs.GT2021★ 3 cited
Combatting Gerrymandering with Ranked Choice Voting: An Experimental Analysis of Multi-member Districts in the United States
Nikhil Garg, Wes Gurnee, David Rothschild +1
Every representative democracy must specify a mechanism under which voters choose their representatives. The most common mechanism in the United States -- Winner takes all single-m…