> Score voting doesn't violate Arrow's Theorem (because it's not a ranked-choice system). This is very much like the idea that radix-sort can run in linear tim

> Score voting doesn't violate Arrow's Theorem (because it's not a ranked-choice system). This is very much like the idea that radix-sort can run in linear time worst-case, because it's not a comparison sort. While absolutely true, both statements can be misleading without context. Just as radix-sort has the weakness of depending on the size of the keyspace (and therefore being poorly suited for sorting small vectors of large numbers), score voting has some issues that do not appear in ranked-choice systems. Most obvious: There is incentive to vote tactically (as is always the case), but the tactics are more complicated than in most other systems. Most serious: Not using a ranked-choice system prevents us from reliably finding a Condorcet winner. One could make the case that these disadvantages aren't as bad as those of ranked-choice systems, just as one can make the case that radix-sort is a generally good way to sort records by a lexographic key. Simply listing advantages doesn't do that, though.