A simple voting scheme generates all binary relations on finite sets

Vicki Knoblauch ()

Journal of Mathematical Economics, 2013, vol. 49, issue 3, 230-233

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 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406813000049
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:49:y:2013:i:3:p:230-233

DOI: 10.1016/j.jmateco.2013.01.002

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().