For what it's worth, I'm working on a software simulation that will allow testing of different systems, to see how close a system of voting can come to aggregat

For what it's worth, I'm working on a software simulation that will allow testing of different systems, to see how close a system of voting can come to aggregating the preferences of voters. Back in 1953, Kenneth Arrow published his Impossibility Theorem, which proved that rank voting failed to aggregate voter preferences. He later won a Nobel Prize, in part for this work. But Arrow remained hopeful about "approval" voting, where the voters get an infinite number of votes. The central problem is that our voting systems today tend to be course-grained, and they need to be fine-grained if they are to aggregate the will of the voters, without having small, random variations swamp the results. So I'm working on a simulation to let everyone experiment with all the possible variables: how many votes, how many candidates, etc.