Elections generate all binary relations on infinite sets
From MaRDI portal
Publication:502374
DOI10.1016/j.mathsocsci.2016.10.002zbMath1397.91171OpenAlexW2545240029MaRDI QIDQ502374
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
Voting theory (91B12) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items (2)
The lexicographic complexity of asymmetric binary relations ⋮ Von Neumann-Morgenstern stable set rationalization of choice functions
Cites Work
- Unnamed Item
- A simple voting scheme generates all binary relations on finite sets
- The non-existence of a utility function and the structure of non-representable preference relations
- May's theorem with an infinite population
- Interval representations for interval orders and semiorders
- On continuous multi-utility representations of semi-closed and closed preorders
- The Voting Problem
- Continuity Properties of Paretian Utility
This page was built for publication: Elections generate all binary relations on infinite sets