=== Connection to Condorcet methods ===
[[File:Condorcet utilitarianism compare and contrast example.png|thumb|2052x2052px]]
Usually, Score voting is computed by adding the scores on each voter's ballot to find the candidate with the most points, who wins. But one can also do it (in a theoretical, and more difficult manner) by, for each pair of candidates, subtracting the score of the lower-scored candidate from the higher-scored candidate, and putting this in a [[Pairwise counting|pairwise counting]] table. The candidate who gets more points in their matchups against all other candidates wins. Example: <blockquote>2: A:5 B:4 C:1
1: C:5 B:3 A:2 </blockquote>The scores are A 12 B 11 C 7.
Score's satisfaction of the above-mentioned property (max of 1 vote of differentiation in a beatpath) is one of the reasons it nominally passes Independence of Irrelevant Alternatives where Condorcet methods don't, as the only time those methods fail it is when no [[Beats-all winner|beats-all winner]] exists, and forcing Condorcet methods to satisfy that property ensures a beats-or-ties-all winner will exist.
== Notes ==