Elections generate all binary relations on infinite sets
From MaRDI portal
Publication:502374
DOI10.1016/J.MATHSOCSCI.2016.10.002zbMATH Open1397.91171OpenAlexW2545240029MaRDI QIDQ502374FDOQ502374
Authors: Vicki Knoblauch 
Publication date: 5 January 2017
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2016.10.002
Recommendations
- A simple voting scheme generates all binary relations on finite sets
- Voting rules for infinite sets and Boolean algebras
- General elections modelled with infinitely many voters
- Impossibility results for infinite-electorate abstract aggregation rules
- Voting Rules from Random Relations
- Representation of a binary relation by a vector criterion on infinite sets
- Gillies and Miller's Subrelations of a Relation over an Infinite Set of Alternatives: General Results and Applications to Voting Games
- scientific article; zbMATH DE number 1058050
- An impossibility theorem for electoral systems
- Shorter Notes: Binary Relations on Sets of Regular Cardinality
Voting theory (91B12) Other classical set theory (including functions, relations, and set algebra) (03E20)
Cites Work
- The non-existence of a utility function and the structure of non-representable preference relations
- On continuous multi-utility representations of semi-closed and closed preorders
- Continuity Properties of Paretian Utility
- The Voting Problem
- A simple voting scheme generates all binary relations on finite sets
- Title not available (Why is that?)
- Interval representations for interval orders and semiorders
- May's theorem with an infinite population
Cited In (4)
This page was built for publication: Elections generate all binary relations on infinite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502374)
