@lime I see, so this would be used in absence of a Condorcet winner like for a ranked pairs resolution?
I was trying to think about burial but I don’t think my method addresses it quite as I conceived. My reasoning was that, by replacing absolute score differences with their more robust percentiles, burial (and bullet voting) strategies will suffer from severely diminishing returns compared with less risky and more honest ballots. For example, burying a second-favorite below a turkey to support a first favorite probably won’t significantly improve the score percentile provided by that voter to the first favorite’s runoff with the second favorite, but will significantly improve the chances of the turkey winning. This makes dishonest burial more severely punished and risky, meaning that fewer rational voters will choose to do it. Also, the effects of the fraction that do will be significantly reduced, since they will not only be fewer in number, but the magnitude of their indicated score differences will be majorly reeled back upon being replaced by their percentiles relative to the more honest bulk.
At the same time, the method is not restricted to Condorcet compliance, since, for example, it is possible for a [1-sqrt(1/2)]~0.2928… fraction minority of voters to overrule a sqrt(1/2)~0.707… fraction majority as long as the whole minority has the top quantile of absolute score differences and all of them have the same sign. That is the smallest possible minority that can overrule a majority in this method. It’s in one sense a generalized, more flexible extension of some of the reasonable measures we already have in the legislative houses, where for example a supermajority (2/3) is required for certain decisions.
Alternatively, each absolute score difference percentile could be measured relative to the distribution of all absolute score differences across all differences. The data set would consist of N*K(K-1)/2 values where N is the number of voters and K is the number of candidates.