Information for "Reversal symmetry"

Jump to navigation Jump to search

Basic information

Display titleReversal symmetry
Default sort keyReversal symmetry
Page length (in bytes)12,608
Page ID370
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Homunq
Date of page creation17:39, 27 October 2016
Latest editorKristomun (talk | contribs)
Date of latest edit09:29, 14 March 2020
Total number of edits6
Total number of distinct authors3
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (16)

Templates used on this page:

Page transcluded on (1)

Template used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
Reversal symmetry is a voting system criterion which requires that if candidate A is the unique winner, and each voter's individual preferences are inverted, then A must not be elected. Methods that satisfy reversal symmetry include Borda count, the Kemeny-Young method, and the Schulze method. Methods that fail include Bucklin voting, instant-runoff voting and Condorcet methods that fail the Condorcet loser criterion such as Minimax.
Information from Extension:WikiSEO