A simple voting scheme generates all binary relations on finite sets

A simple head-to-head voting scheme in which voters hold complete and transitive preferences over alternatives generates all binary relations on finite sets. The minimal number of voters required to generate a binary relation provides a measure of complexity for binary relations. Complexity so defined tells us, by how much a given binary relation fails to qualify as a total preorder.