A simple voting scheme generates all binary relations on finite sets |
| |
Authors: | Vicki Knoblauch |
| |
Affiliation: | Department of Economics, University of Connecticut, 309 Oak Hall, 365 Fairfield Way, Unit 1063, Storrs, CT 06269-1063, USA |
| |
Abstract: | 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. |
| |
Keywords: | Binary relations Elections |
本文献已被 ScienceDirect 等数据库收录! |
|