random-subset voting

Most of the voting procedures in the literature assume that voters have complete and transitive preferences over the alternatives. a basic premise is that any voter is able to evaluate any pair of alternatives in a set and select his/her preferred one, or indicate indifference between them. nevertheless, some researchers have highlighted that voters, as humans, have limited capacity to deal with and consequently compare big sets of alternatives. in this paper, we propose the random-subset voting, a voting procedure that through a random approach allows the voters to evaluate less alternatives. instead of analyzing the entire set of alternatives, each voter will evaluate a random subset of a pre-determined size. we have proposed a theorem indicating that, for large sets of voters, the outcomes of traditional borda and random-subset borda converge. we have also implemented a web experiment and a monte carlo simulation in order to validate the proposed procedure and analyze how it behaves in several scenarios.