 Myerson (1995) introduced a general framework for characterizing abstract scoring rules that include Borda Count and Approval Voting as examples. The key idea is to think of a ballot, called a signal or a vote, as a function from candidates to a set \(\mathcal{V}\), where \(\mathcal{V}\) is a set of numbers. That is, the set of ballots is a subset of \(\mathcal{V}^X\) (the set of functions from \(X\) to \(\mathcal{V}\)). Then, an anonymous profile of signals assigns a score to each candidate \(X\) by summing the numbers assigned to \(X\) by each voter. This allows us to define voting methods  by specifying the set of ballots: 