A simple voting scheme generates all binary relations on finite sets

DOI10.1016/J.JMATECO.2013.01.002zbMATH Open1280.91056OpenAlexW2012407715MaRDI QIDQ386063FDOQ386063

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

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

zbMATH Keywords

electionsbinary relations

Mathematics Subject Classification ID

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

Cites Work

• Utility Theory without the Completeness Axiom
• Basic Geometry of Voting
• Utility Functions for Partially Ordered Topological Spaces
• A general extension theorem for binary relations
• Continuity Properties of Paretian Utility
• The Voting Problem
• Interval representations for interval orders and semiorders
• Quasi-Transitivity, Rational Choice and Collective Decisions
• 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)