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.

MoreLess

Year of publication:	2013
Authors:	Knoblauch, Vicki
Published in:	Journal of Mathematical Economics. - Elsevier, ISSN 0304-4068. - Vol. 49.2013, 3, p. 230-233
Publisher:	Elsevier
Subject:	Binary relations \| Elections

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010666238