Take an election for some governmental office. Iterated Voting is a system of proxy voting that works like this.
-Put each voter in a small group.
-Each small group discusses their qualifications and decides which of them should advance towards the office.
-The advancing members are again paired (or trio’d), and the process is repeated until there is only one voter left.
In an electorate of 300 million, this process would take less than 30 iterations for groups of two, and fewer for larger groups (log base x of 300 million, where x is the group size).
The method the groups use to choose who advances can be any of a number: they could decide by consensus, they could vote (assuming an odd number), or they could draw straws.
The system would be difficult to game, because gaming would require the collaboration of a significant part of the electorate. If the grouping were random, it would effectively require the entire electorate to participate. If the grouping were not random, it would require only a very small group, ((x/2+1)/x)^y, where x is group size and y is the number of iterations.
How representative could such an outcome be? Iterative processes are good at aggregating certain types of information, but voter preference may not be aggregated very well by them. It should be possible to come up with scenarios where the best person is eliminated in favor of the worst: two groups of majority bad voters/representatives (i.e. those who vote for bad voters/representatives or would make bad office holders) and one group of good voters/representatives (i.e. those who vote for good voters/representatives or would make good office holders) would result in the selection of a bad office holder. In the real world, would this outcome be likely?