A simple voting scheme generates all binary relations on finite sets

DOI10.1016/j.jmateco.2013.01.002zbMath1280.91056OpenAlexW2012407715MaRDI QIDQ386063

Vicki Knoblauch

Publication date: 13 December 2013

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2013.01.002

zbMATH Keywords

electionsbinary relations

Mathematics Subject Classification ID

Voting theory (91B12) Group preferences (91B10) Social choice (91B14)

Related Items

A characterization of the \(n\)-agent Pareto dominance relation, The lexicographic complexity of asymmetric binary relations, Elections generate all binary relations on infinite sets, Probabilistic evaluations: a universal representation for preferences over countable sets

Cites Work

• A general extension theorem for binary relations
• Interval representations for interval orders and semiorders
• The Voting Problem
• Basic Geometry of Voting
• Continuity Properties of Paretian Utility
• Quasi-Transitivity, Rational Choice and Collective Decisions
• Utility Functions for Partially Ordered Topological Spaces
• Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?
• Utility Theory without the Completeness Axiom