A simple voting scheme generates all binary relations on finite sets (Q386063): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jmateco.2013.01.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2012407715
@@ Property / OpenAlex ID: W2012407715 / rank @@
+Normal rank
@@ Property / cites work @@
+Utility Theory without the Completeness Axiom
@@ Property / cites work: Utility Theory without the Completeness Axiom / rank @@
+Normal rank
@@ Property / cites work @@
+Continuity Properties of Paretian Utility
@@ Property / cites work: Continuity Properties of Paretian Utility / rank @@
+Normal rank
@@ Property / cites work @@
+A general extension theorem for binary relations
@@ Property / cites work: A general extension theorem for binary relations / rank @@
+Normal rank
@@ Property / cites work @@
+Interval representations for interval orders and semiorders
+Normal rank
@@ Property / cites work @@
+Utility Functions for Partially Ordered Topological Spaces
+Normal rank
@@ Property / cites work @@
+Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?
+Normal rank
@@ Property / cites work @@
+Basic Geometry of Voting
@@ Property / cites work: Basic Geometry of Voting / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-Transitivity, Rational Choice and Collective Decisions
+Normal rank
@@ Property / cites work @@
+The Voting Problem
@@ Property / cites work: The Voting Problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:386063