Ranked Robin: Difference between revisions

Ranked Robin was invented by [[User:Sass|Sass]] on 30 September 2021 and named by Sara Wolk on 7 November 2021. As an enthusiast of [[Cardinal voting systems|cardinal voting methods]] and a strong advocate for voter empowerment, Sass saw a timely need for a sufficiently-accurate [[Ranked voting|ranked voting method]] that was on par with the simplicity of voting methods like [[STAR Voting]] and even [[Approval Voting]], particularly in the [[United States]]. Ranked Robin is nearly identical to the earliest known Condorcet method, invented by [[Ramon Llull]] in his 1299 treatise ''Ars Electionis''<ref name="Hagele">{{cite journal |author1=G. Hägele |author2=F. Pukelsheim |lastauthoramp=yes | title=Llull's writings on electoral systems | journal=Studia Lulliana | year=2001 | volume=41 | pages=3–38 | url=http://www.math.uni-augsburg.de/stochastik/pukelsheim/2001a.html }}</ref>, which was similarly replicated by [[w:Marquis de Condorcet|Marquis de Condorcet]] centuries later, and then again by [[w:Arthur Herbert Copeland|Arthur Herbert Copeland]]. A mathematically identical method to Ranked Robin including the first tie-breaking mechanic was described by Partha Dasgupta and Eric Maskin in 2004<ref>{{Cite journal|last=Maskin|first=Eric|last2=Dasgupta|first2=Partha|date=2004|title=The Fairest Vote of All|url=https://scholar.harvard.edu/maskin/publications/fairest-vote-all|journal=Scientific American|volume=|issue=290|pages=64-69|via=Harvard University}}</ref>. The primary innovation of Ranked Robin is the reduction and formatting of results in such a way that they are palatable to a general audience, as a full [[Pairwise comparison matrix|preference matrix]] can be overwhelming for most voters. This innovation can likely be adapted to simplify the results of other voting methods that use [[pairwise counting]], particularly those that first restrict the set of winners such as [[Smith-efficient|Smith-efficient voting methods]].