A simple voting scheme generates all binary relations on finite sets

B-Tier
Journal: Journal of Mathematical Economics
Year: 2013
Volume: 49
Issue: 3
Pages: 230-233

Score contribution per author:

2.011 = (α=2.01 / 1 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

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.

Technical Details

RePEc Handle
repec:eee:mateco:v:49:y:2013:i:3:p:230-233
Journal Field
Theory
Author Count
1
Added to Database
2026-01-25