A simple voting scheme generates all binary relations on finite sets

DOI10.1016/J.JMATECO.2013.01.002MaRDI QIDQ386063zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Elections generate all binary relations on infinite sets
• Voting Rules from Random Relations
• Voting procedures, complexity of
• Hierarchical voting
• A note on the voting problem

Cites work

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

Cited in

(4)

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

This page was built for publication: A simple voting scheme generates all binary relations on finite sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386063)