sylviasolo

CS412Project

Capacity_Management_In_A_Pandemic

Optimal_Strategies_in_RCV

These codes can be used to find optimal vote-addition strategies in ranked choice voting. We first reduce the election instance using our fast algorithm on trimming the candidate set under uncertainty of up to B votes. The code then outputs the optimal addition strategies for remaining candidates.

Votemandering

Contains two notebooks (for grid instances and state maps), and a few data-files accompanying the codes.

sylviasolo/Capacity_Management_In_A_Pandemic

sylviasolo/Optimal_Strategies_in_RCV

These codes can be used to find optimal vote-addition strategies in ranked choice voting. We first reduce the election instance using our fast algorithm on trimming the candidate set under uncertainty of up to B votes. The code then outputs the optimal addition strategies for remaining candidates.

sylviasolo/Votemandering

Contains two notebooks (for grid instances and state maps), and a few data-files accompanying the codes.