election-methods@mailman.electorama.com

Technical discussion of election methods

View all threads

Novel Electoral System

DK
Daniel Kirslis
Mon, May 19, 2025 12:13 AM

Hi Abel,

Thanks so much for taking the time to read the paper and respond. Your
response is very interesting, and to be honest, I am still working on fully
wrapping my head around it.

In the response I just sent to rb-j, I outline some more of my thinking
about the Condorcet winner principle that I discuss in section 9. All in
all, I agree that my arguments do not demonstrate that Condorcet's emphasis
on pairwise dominance is wrong. However,I think they show that Condorcet
methods are one paradigm, and, as you say, non-Condorcet methods are
another paradigm. The K-count is a proposal to strike a middle path between
the two paradigms.

You say "I wonder how exactly your approach can be integrated into this
framework and to which is it closer (if it's not THE "middle", what is, and
what other means can we define - arithmetic, geometric, harmonic, etc. -
and is this the quadratic mean?)." This is a really interesting question.
It is my belief that it is the 'THE middle' in some sense, but I don't have
any kind of rigorous framework to prove that. I am hoping that these
discussions will help shed some light on this question.

Thanks again,

Dan

On Sun, May 18, 2025 at 2:42 PM Abel Stan stanabelhu@gmail.com wrote:

Hi Dan,

Thank you for this contribution, I have not yet encountered such a system,
nor this sort of visualisation, conceptualization between Borda and
Condorcet.
The usual link between these two approaches is the fact that Borda is the
neutral positional system, giving equally spaced points. I give +1 point
to every candidate I rank one above another. I give +2 points to anyone I
rank two points above. That's why the Borda score is the sum of the
number of all won pairwise duels. This gives the duality of Borda so that
it can be described as both a positional and a pairwise count.
Condorcet/Smith are the "unanimity" of pairwise aggretations (Copeland is
the plurality of pairwise aggregations), while Borda is the plurality of
non aggregated pairwise votes (I guess Pareto is the unanimity of
non-aggregated pairwise votes). So in some sense, Condorcet is aggregation
of pairwise pluralities, while Borda is plurality of pairwise aggregations.
To me, the Condorcet principle seems to make much more sense, since by
these definitions, Borda is far less independent of irrelevant alternatives
(granted, Condorcet on its own is defined with 'unanimity' which also means
it needs an extension to be more decisive). I wonder how exactly your
approach can be integrated into this framework and to which is it closer
(if it's not THE "middle", what is, and what other means can we define -
arithmetic, geometric, harmonic, etc. - and is this the quadratic mean?).

I struggle with section 9. I understand the point that the Condorcet
principle might have a tautology (like in me saying because of the above
is Condorcet is more "majoritarian", and Borda more "pluralitarian"
because I define "majority" and "majoritarianism" as aggregating pairwise
first, while aggregating non-pairwise I will consider by definition
"pluralitarian" because of the possibility of aggregating more that 2
candidates at once) in saying the pairwise preference is what matters,
because it's what should matter. But why would the "paradox" break this? If
there is no paradox, that is like when there is unanimity, it's good, but
the rule should still say what happens if there is no unanimity. The same
way we can say in a race of 2 (where Borda and Condorcet are equivalent) if
there is no unanimity simple majority should suffice, we can define what
should suffice in case there is no Condorcet winner. Or if FPP (with ranked
ballots) leads to a tie, we can define a tiebreaker with the next
preferences. We can say we want methods that satisfy unanimity or that have
tiebreakers without expecting that all social preferences can be aggregated
with unanimity alone or without ties. Same goes for Condorcet, the
unanimity of simple majorities. Of course, you could also establish a
'Borda criterion', the plurality of pairwise points, but that would
essentially just say you have to choose the one Borda winner if there
exists one, and one of the Borda winners, if there is a tie. The analogies
in the paper seem unconvincing to me, I doubt that the unanimity criterion
is any less tautological. That's not to say that non-Condorcet paradigms
are not valid, but they are paradigms - similarly to non-Euclidean geometry

  • as far as I know.

Abel

Daniel Kirslis via Election-Methods election-methods@lists.electorama.com
ezt írta (időpont: 2025. máj. 18., V, 19:52):

Hi all,

Thanks so much for the replies. I’ll respond to everyone in this thread.

Andy - I really appreciate your feedback. Your summary is correct, and
your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of
thinking about it that I had not considered. It seems like a potentially
fruitful lens for understanding it. And, as perhaps you have surmised, I
may have been mistaken in the statement about the sincere favorite
criteria, but I am working on an analysis of the issue that I will share.

Toby, making a short summary is a great suggestion. The argument in
the paper is admittedly a bit convoluted before it presents the actual
method. Here is the simplified way that I would explain it:

Each voter ranks their preferences, with ties allowed and unranked
candidates treated as last-place preferences. Then, for each candidate, you
make a plot, where each axis is the total number of times that they were
preferred to each of their opponents. So, if the candidates are A, B, and
C, candidate A’s plot would have “number of times preferred to B” on one
axis and “number of times preferred to C” on the other axis. Candidate B &
C could be plotted similarly in terms of their opponents. The winner is
simply the candidate who is plotted the farthest up and to the right, or
closest to topmost and rightmost point, which is where a candidate who is
the unanimous first-place choice would be plotted. The distance from that
point is calculated using the Pythagorean theorem, which is where
minimizing the sum of squares that Andy referenced comes in.

The figures in the paper tell the story better than the words, as it is
essentially a geometric idea. And, sections 4, 5, and 6 can really be
skipped - they are more about justifying the approach than explaining it.

Chris, you asked “Why should we be interested in the "concerns" of
Borda (whatever they are)? And so much that we should embrace a method that
fails the Condorcet criterion?” Great question. If you look at the Stanford
Encyclopedia of Philosophy’s entry on Social Choice Theory, they list
Condorcet and Borda as the original pioneers of this thinking (
https://plato.stanford.edu/entries/social-choice/). Borda thinks about
majoritarianism in terms of votes, while Condorcet thinks about it in terms
of voters. Obviously, in FPP elections, these are the same, but the heart
of the interest in these questions comes from the tension that arises
between them in a ranked-choice setting, where each voter has multiple
votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a
thinker who studies these issues and has argued most persuasively for
Borda’s approach over Condorcet methods. In section 9 of my paper, I
explain some of my philosophical objections to the Condorcet winner
criterion.

You also asked “Do you propose allowing above-bottom equal ranking or
truncation?” Equal ranking is allowed, and unranked candidates are treated
as last place.

And, I am afraid I may have actually been mistaken about the sincere
favorite property, so will have to disappoint you there.

You asked “Who does your method elect in this example?

46 A
44 B>C
10 C”

If I am understanding your notation correctly, A would win in this
example. The full ranking would be:
A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2))
B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2))
C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2))

As you can see, when a candidate only appears as a first-place or
last-place preference, their K-count is simply equal to the number of
voters ranking them first.

Thanks all!

On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) <
elections@jenningsstory.com> wrote:

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the candidate with
the smallest sum of SQUARES of non-victories (defeats plus ties) against
their opponents.

Taking the square root and dividing can make it meaningful by scaling it
to [0,1] or [0,s] (where s is the number of voters), but doesn't change the
finish order.

It does seem like an interesting attempt to "square the circle" (great
pun) and compromise between Borda and Condorcet. I hadn't realized that
Borda and Minimax are minimizing the one-norm and infinity-norm in the same
geometric space. The two-norm certainly seems like it should be explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via
Election-Methods election-methods@lists.electorama.com wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this
message violates any norms or protocols that the members of this list
adhere to.

I have recently developed a novel method for tabulating ranked-choice
elections that attempts to reconcile the concerns of Borda and Condorcet. I
believe that it maintains the simplicity and mathematical elegance of the
Borda count while incorporating Condorcet's concern with pairwise
dominance. Intuitively, it can be understood as ordering candidates by how
close they come to being unanimously selected when plotted in Cartesian
coordinate space. Here is a link to the paper:

https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing

Given its simplicity, I have been very surprised to discover that this
method has never been proposed before. I am hoping that some of you all
will take a look at the paper and share your comments, questions, and
critiques. Ultimately, it is my hope that ranked-choice voting advocates
can arrive at a consensus about the best method for RCV and thus strengthen
efforts to adopt it and deliver much needed democratic improvements. But
even if you don't find the system itself compelling, you may find the
method of plotting electoral outcomes elucidated in the paper to be useful
for the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - see https://electorama.com/em for list
info

Hi Abel, Thanks so much for taking the time to read the paper and respond. Your response is very interesting, and to be honest, I am still working on fully wrapping my head around it. In the response I just sent to rb-j, I outline some more of my thinking about the Condorcet winner principle that I discuss in section 9. All in all, I agree that my arguments do not demonstrate that Condorcet's emphasis on pairwise dominance is *wrong*. However,I think they show that Condorcet methods are one paradigm, and, as you say, non-Condorcet methods are another paradigm. The K-count is a proposal to strike a middle path between the two paradigms. You say "I wonder how exactly your approach can be integrated into this framework and to which is it closer (if it's not THE "middle", what is, and what other means can we define - arithmetic, geometric, harmonic, etc. - and is this the quadratic mean?)." This is a really interesting question. It is my belief that it is the 'THE middle' in some sense, but I don't have any kind of rigorous framework to prove that. I am hoping that these discussions will help shed some light on this question. Thanks again, Dan On Sun, May 18, 2025 at 2:42 PM Abel Stan <stanabelhu@gmail.com> wrote: > Hi Dan, > > Thank you for this contribution, I have not yet encountered such a system, > nor this sort of visualisation, conceptualization between Borda and > Condorcet. > The usual link between these two approaches is the fact that Borda is the > neutral positional system, giving equally spaced points. I give +1 point > to every candidate I rank one above another. I give +2 points to anyone I > rank two points above. That's why the Borda score is the sum of the > number of all won pairwise duels. This gives the duality of Borda so that > it can be described as both a positional and a pairwise count. > Condorcet/Smith are the "unanimity" of pairwise aggretations (Copeland is > the plurality of pairwise aggregations), while Borda is the plurality of > non aggregated pairwise votes (I guess Pareto is the unanimity of > non-aggregated pairwise votes). So in some sense, Condorcet is aggregation > of pairwise pluralities, while Borda is plurality of pairwise aggregations. > To me, the Condorcet principle seems to make much more sense, since by > these definitions, Borda is far less independent of irrelevant alternatives > (granted, Condorcet on its own is defined with 'unanimity' which also means > it needs an extension to be more decisive). I wonder how exactly your > approach can be integrated into this framework and to which is it closer > (if it's not THE "middle", what is, and what other means can we define - > arithmetic, geometric, harmonic, etc. - and is this the quadratic mean?). > > I struggle with section 9. I understand the point that the Condorcet > principle might have a tautology (like in me saying because of the above > is Condorcet is more "majoritarian", and Borda more "pluralitarian" > because I define "majority" and "majoritarianism" as aggregating pairwise > first, while aggregating non-pairwise I will consider by definition > "pluralitarian" because of the possibility of aggregating more that 2 > candidates at once) in saying the pairwise preference is what matters, > because it's what should matter. But why would the "paradox" break this? If > there is no paradox, that is like when there is unanimity, it's good, but > the rule should still say what happens if there is no unanimity. The same > way we can say in a race of 2 (where Borda and Condorcet are equivalent) if > there is no unanimity simple majority should suffice, we can define what > should suffice in case there is no Condorcet winner. Or if FPP (with ranked > ballots) leads to a tie, we can define a tiebreaker with the next > preferences. We can say we want methods that satisfy unanimity or that have > tiebreakers without expecting that all social preferences can be aggregated > with unanimity alone or without ties. Same goes for Condorcet, the > unanimity of simple majorities. Of course, you could also establish a > 'Borda criterion', the plurality of pairwise points, but that would > essentially just say you have to choose the one Borda winner if there > exists one, and one of the Borda winners, if there is a tie. The analogies > in the paper seem unconvincing to me, I doubt that the unanimity criterion > is any less tautological. That's not to say that non-Condorcet paradigms > are not valid, but they are paradigms - similarly to non-Euclidean geometry > - as far as I know. > > Abel > > > > Daniel Kirslis via Election-Methods <election-methods@lists.electorama.com> > ezt írta (időpont: 2025. máj. 18., V, 19:52): > >> Hi all, >> >> Thanks so much for the replies. I’ll respond to everyone in this thread. >> >> *Andy* - I really appreciate your feedback. Your summary is correct, and >> your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of >> thinking about it that I had not considered. It seems like a potentially >> fruitful lens for understanding it. And, as perhaps you have surmised, I >> may have been mistaken in the statement about the sincere favorite >> criteria, but I am working on an analysis of the issue that I will share. >> >> *Toby*, making a short summary is a great suggestion. The argument in >> the paper is admittedly a bit convoluted before it presents the actual >> method. Here is the simplified way that I would explain it: >> >> *Each voter ranks their preferences, with ties allowed and unranked >> candidates treated as last-place preferences. Then, for each candidate, you >> make a plot, where each axis is the total number of times that they were >> preferred to each of their opponents. So, if the candidates are A, B, and >> C, candidate A’s plot would have “number of times preferred to B” on one >> axis and “number of times preferred to C” on the other axis. Candidate B & >> C could be plotted similarly in terms of their opponents. The winner is >> simply the candidate who is plotted the farthest up and to the right, or >> closest to topmost and rightmost point, which is where a candidate who is >> the unanimous first-place choice would be plotted. The distance from that >> point is calculated using the Pythagorean theorem, which is where >> minimizing the sum of squares that Andy referenced comes in.* >> >> The figures in the paper tell the story better than the words, as it is >> essentially a geometric idea. And, sections 4, 5, and 6 can really be >> skipped - they are more about justifying the approach than explaining it. >> >> *Chris*, you asked “Why should we be interested in the "concerns" of >> Borda (whatever they are)? And so much that we should embrace a method that >> fails the Condorcet criterion?” Great question. If you look at the Stanford >> Encyclopedia of Philosophy’s entry on Social Choice Theory, they list >> Condorcet and Borda as the original pioneers of this thinking ( >> https://plato.stanford.edu/entries/social-choice/). Borda thinks about >> majoritarianism in terms of votes, while Condorcet thinks about it in terms >> of voters. Obviously, in FPP elections, these are the same, but the heart >> of the interest in these questions comes from the tension that arises >> between them in a ranked-choice setting, where each voter has multiple >> votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a >> thinker who studies these issues and has argued most persuasively for >> Borda’s approach over Condorcet methods. In section 9 of my paper, I >> explain some of my philosophical objections to the Condorcet winner >> criterion. >> >> You also asked “Do you propose allowing above-bottom equal ranking or >> truncation?” Equal ranking is allowed, and unranked candidates are treated >> as last place. >> >> And, I am afraid I may have actually been mistaken about the sincere >> favorite property, so will have to disappoint you there. >> >> You asked “Who does your method elect in this example? >> >> 46 A >> 44 B>C >> 10 C” >> >> If I am understanding your notation correctly, A would win in this >> example. The full ranking would be: >> A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2)) >> B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2)) >> C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2)) >> >> As you can see, when a candidate only appears as a first-place or >> last-place preference, their K-count is simply equal to the number of >> voters ranking them first. >> >> Thanks all! >> >> On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) < >> elections@jenningsstory.com> wrote: >> >>> Hi Dan, >>> >>> Great paper. Thank you for posting! >>> >>> It seems like the short version is that the winner is the candidate with >>> the smallest sum of SQUARES of non-victories (defeats plus ties) against >>> their opponents. >>> >>> Taking the square root and dividing can make it meaningful by scaling it >>> to [0,1] or [0,s] (where s is the number of voters), but doesn't change the >>> finish order. >>> >>> It does seem like an interesting attempt to "square the circle" (great >>> pun) and compromise between Borda and Condorcet. I hadn't realized that >>> Borda and Minimax are minimizing the one-norm and infinity-norm in the same >>> geometric space. The two-norm certainly seems like it should be explored. >>> >>> I would love to see the proof of non-favorite-betrayal. >>> >>> Best, >>> >>> ~ Andy >>> On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via >>> Election-Methods <election-methods@lists.electorama.com> wrote: >>> >>> Hello! >>> >>> I am a newcomer to this mailing list, so please forgive me if this >>> message violates any norms or protocols that the members of this list >>> adhere to. >>> >>> I have recently developed a novel method for tabulating ranked-choice >>> elections that attempts to reconcile the concerns of Borda and Condorcet. I >>> believe that it maintains the simplicity and mathematical elegance of the >>> Borda count while incorporating Condorcet's concern with pairwise >>> dominance. Intuitively, it can be understood as ordering candidates by how >>> close they come to being unanimously selected when plotted in Cartesian >>> coordinate space. Here is a link to the paper: >>> >>> https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing >>> >>> Given its simplicity, I have been very surprised to discover that this >>> method has never been proposed before. I am hoping that some of you all >>> will take a look at the paper and share your comments, questions, and >>> critiques. Ultimately, it is my hope that ranked-choice voting advocates >>> can arrive at a consensus about the best method for RCV and thus strengthen >>> efforts to adopt it and deliver much needed democratic improvements. But >>> even if you don't find the system itself compelling, you may find the >>> method of plotting electoral outcomes elucidated in the paper to be useful >>> for the analysis of other electoral systems. >>> >>> Thank you! >>> >>> -Dan >>> >>> >>> ---- >> Election-Methods mailing list - see https://electorama.com/em for list >> info >> >
RB
robert bristow-johnson
Mon, May 19, 2025 1:17 AM

Hi Dan,

On 05/18/2025 7:46 PM EDT Daniel Kirslis dankirslis@gmail.com wrote:

Hi r b-j,

Thank you for this response. I want to address both of your principles.

First, is "one person, one vote". I of course agree completely that each individual's vote should be treated exactly equally, and the K-count does this.

It's not enough that the rules are consistent with every voter.  FPTP and IRV or Bucklin or Borda or Score Voting have consistent rules, but do not necessarily value each vote equally.  And when the Kirslis method does not elect the CW, neither does that method value each vote equally.

You say that "for any ranked ballot, this means that if Candidate A is ranked higher than Candidate B then that is a vote for A... It doesn't matter how many levels A is ranked higher than B, it counts as exactly one vote for A." This is precisely how the K-count works - if A is ranked above B on one ballot, then A advances by one along the 'preferred to B' axis. The number of rankings between them is immaterial to A's position vis a vis the B axis.

Well, it's a little more sophisticated than that.  It's obscured in your method, but for Kirslis to elect a non-CW to exist, the K-count elected candidate has to pick up more points than the CW and the only way to do that is for that candidate to get some spread by defeating other candidates that have preference over the CW in many ballots.  That means there are ballots with more than one level separating the K-candidate from CW.  It's a little Borda-ish as you've alluded to in your paper.  And we know that Borda explicitly counts spread, which means if I enthusiastically prefer A>...>B and you tepidly prefer B>A, my vote for A will count more than your vote for B if it comes down to a dogfight between A and B.  Your method is, I believe, vulnerable to burying.

However, if A is ranked above other candidates on that ballot, A will also advance along those candidates' axes, so it is perhaps not exactly "one vote". But each voter's vote has the same potential power.

Well, so do voters all have the same potential power with Score Voting, but we know that if I score A with a 5 and B with a 0 and you score B with a 5 and A with a 4, my vote for A will count five times more than your vote for B if it comes down to A and B being the principal candidates.  Just because the rules are the same for you and me, does not mean that our votes count the same.

To your second principle. You say "I cannot understand why, if a Condorcet winner exists, how any other method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet." Let me give an example to illustrate, which relates to the principle of majority rule.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million voters. Let us suppose that candidate A is unanimously preferred to every other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other candidate by the same 2 vote margin, and is thus very narrowly a Condorcet winner. Does it really reflect the will of the majority better to declare candidate Z the winner because of his extraordinarily narrow margin over all of the opposition when candidate A is the unanimous favorite versus everyone but Candidate Z, to whom she barely loses?

To make this more comprehensible, let's say 100 voters and three candidates, A, B, and Z.

A>B 100
B>A 0
A>Z 49
Z>A 51
B>Z 49
Z>B 51

Now, how does this break down to these nine numbers?

A>B>Z
A>Z>B
A only

B>A>Z
B>Z>A
B only

Z>A>B
Z>B>A
Z only

Can you turn the six numbers above into the nine numbers below in a consistent manner?  Then I can get a grip on your scenario.  But I am not sure you can do it.

Many more preferences are violated by choosing the Condorcet winner in this case than choosing candidate A. This is the heart of the issue with the Condorcet winner criteria - if a Condorcet winner exists, a Condorcet method must completely ignore the size of the margins of victory, no matter how large.

Well, in close elections, that is always the case.  In FPTP if A gets 500,001 and B gets 499,999 there will be a recount, but A will win if these tallies result.

In my view, this curtails the meaning of 'majority rule' in a way that feels undemocratic.

I am not familiar with the Burlington election that you reference, and I will look into it when I have a chance. I don't know what the K-count would decide in that case. But I can try to answer in principle your question "How possibly can Candidate B be elected without counting those 3476 voters' individual votes a little more (like 17% more) than how much the votes were counted from the 4064 voters preferring Candidate A?"

Just FYI, in the U.S. there have been over 500 RCV elections that FairVote has tracked and analyzed.  I read from someone else that now the number is more than 800, I just haven't yet seen a good consistent searchable database online.  Maybe one exists, I just haven't seen it yet.

Of the 500 RCV elections over 300 had two or fewer candidates, so RCV does nothing at all in those elections differently than FPTP.  Of the 200 that had three or more candidates, more than half had one of the candidates with more than 50% of the vote in the first round, so again RCV does nothing different.  Of the fewer than 100 left that had more than one round, all but 26 had elected the candidate with the most first-choice votes, so again, RCV did nothing different than FPTP.  The remaining 26 had "come-from-behind" winners in which the RCV winner was the candidate in second place in the semifinal round, and that's when RCV did something different than FPTP.

There were four RCV elections where the RCV winner was not the Condorcet winner.  Two of the four had no Condorcet winner (they had a Rock-Paper-Scissors cycle, a Smith set of size 3).  Those were Minneapolis City Council Ward 2 in 2021 and Oakland School Board District 4 in 2022.  That leaves two RCV elections that had a Condorcet winner, but didn't elect the Condorcet winner: Burlington mayoral 2009 and Alaska at-large Representative to Congress in a Special Election in August 2022.  Both of those elections were followed immediately by a serious repeal effort.  In Burlington the repeal succeeded for 12 years (RCV has now returned to Burlington) and in Alaska the repeal effort failed by 0.2% margin when there was a 100-to-1 campaign spending ratio ($15 million spent to defeat repeal and $120,000 to support repeal of RCV).  They are launching another petition drive to put repeal on the ballot again in 2026.  When the CW is not elected, it's a close 3-way race and when it's not a cycle, it's the Center Squeeze effect.

I wrote a paper about the the Burlington election where I simply replaced the hypotheticals of what happens when the CW is not elected with real names of real people and real numbers.  It's not a particularly theoretical paper, more political and advocacy, but I try to lay down the principles and maybe channel the thoughts of Condorcet in the paper.  And I happen to live in Burlington and voted in that election in 2009.  Nic Tideman thought the paper was good enough for publication: https://link.springer.com/journal/10602/volumes-and-issues/34-3 but the edited published version gutted some content (mostly a table and figures with color), so I think the submitted version is better and I can share that to anyone without copyright violation: https://drive.google.com/file/d/1jIhFQfEoxSdyRz5SqEjZotbVDx4xshwM/view .

In the K-count, for Candidate B to be elected in this scenario, there would need to be a 3rd candidate (or multiple other candidates) to whom B was widely preferred but A was not. So, B would win because the people who favored A still preferred B to C, while the people who favored B preferred C to A. If you only look at the head-to-head votes of A vs. B, this seems anti-majoritarian, but the point I make in the paper is that you cannotmake valid inferences by decontextualizing the data like that, as doing so can lead you into the logical contradiction of a Condorcet cycle. It is in the very nature of multi-option preference aggregation that the data cannot be decomposed in this way. Another way of thinking about this is - suppose that while A is preferred to B, B is preferred to C, and C is preferred to A, so you have a classic Condorcet cycle. Then, someone must be declared the winner, so in your reasoning, someone's votes will be counted for more than someone else's. And, when resolving this issue, most Condorcet methods will look at the margins of victory, even though they are ignored in the case when a Condorcet winner exists. But if margins matter enough to decide a winner when no Condorcet winner exists, why is it okay to completely ignore them when a Condorcet winner does exist?

The K-count is a way of trying to reconcile Condorcet's conception of majority rule, which looks for majority in terms of each head-to-head matchup, with Borda's conception of majority rule, which seeks to honor the maximum number of individual pairwise preferences.

L8r,

robert

--

r b-j . _ . _ . _ . _ rbj@audioimagination.com

"Imagination is more important than knowledge."

.
.
.

Hi Dan, > On 05/18/2025 7:46 PM EDT Daniel Kirslis <dankirslis@gmail.com> wrote: > > > Hi r b-j, > > Thank you for this response. I want to address both of your principles. > > First, is "one person, one vote". I of course agree completely that each individual's vote should be treated exactly equally, and the K-count does this. It's not enough that the *rules* are consistent with every voter. FPTP and IRV or Bucklin or Borda or Score Voting have consistent rules, but do not necessarily value each vote equally. And when the Kirslis method does not elect the CW, neither does that method value each vote equally. > You say that "for any ranked ballot, this means that if Candidate A is ranked higher than Candidate B then that is a vote for A... It doesn't matter how many levels A is ranked higher than B, it counts as exactly one vote for A." This is precisely how the K-count works - if A is ranked above B on one ballot, then A advances by one along the 'preferred to B' axis. The number of rankings between them is immaterial to A's position vis a vis the B axis. Well, it's a little more sophisticated than that. It's obscured in your method, but for Kirslis to elect a non-CW to exist, the K-count elected candidate has to pick up more points than the CW and the only way to do that is for that candidate to get some spread by defeating other candidates that have preference over the CW in many ballots. That means there are ballots with more than one level separating the K-candidate from CW. It's a little Borda-ish as you've alluded to in your paper. And we *know* that Borda explicitly counts spread, which means if I enthusiastically prefer A>...>B and you tepidly prefer B>A, my vote for A will count more than your vote for B if it comes down to a dogfight between A and B. Your method is, I believe, vulnerable to burying. > However, if A is ranked above other candidates on that ballot, A will also advance along those candidates' axes, so it is perhaps not exactly "one vote". But each voter's vote has the same potential power. Well, so do voters all have the same potential power with Score Voting, but we *know* that if I score A with a 5 and B with a 0 and you score B with a 5 and A with a 4, my vote for A will count five times more than your vote for B if it comes down to A and B being the principal candidates. Just because the rules are the same for you and me, does not mean that our votes count the same. > To your second principle. You say "I cannot understand why, *if* a Condorcet winner exists, how *any* other method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet." Let me give an example to illustrate, which relates to the principle of majority rule. > > Imagine an election with 26 candidates, A, B, C... Z, and 1 million voters. Let us suppose that candidate A is unanimously preferred to every other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other candidate by the same 2 vote margin, and is thus very narrowly a Condorcet winner. Does it really reflect the will of the majority better to declare candidate Z the winner because of his extraordinarily narrow margin over all of the opposition when candidate A is the unanimous favorite versus everyone but Candidate Z, to whom she barely loses? To make this more comprehensible, let's say 100 voters and three candidates, A, B, and Z. A>B 100 B>A 0 A>Z 49 Z>A 51 B>Z 49 Z>B 51 Now, how does this break down to these nine numbers? A>B>Z A>Z>B A only B>A>Z B>Z>A B only Z>A>B Z>B>A Z only Can you turn the six numbers above into the nine numbers below in a consistent manner? Then I can get a grip on your scenario. But I am not sure you can do it. > Many more preferences are violated by choosing the Condorcet winner in this case than choosing candidate A. This is the heart of the issue with the Condorcet winner criteria - if a Condorcet winner exists, a Condorcet method must completely ignore the size of the margins of victory, no matter how large. Well, in close elections, that is always the case. In FPTP if A gets 500,001 and B gets 499,999 there will be a recount, but A will win if these tallies result. > In my view, this curtails the meaning of 'majority rule' in a way that feels undemocratic. > > I am not familiar with the Burlington election that you reference, and I will look into it when I have a chance. I don't know what the K-count would decide in that case. But I can try to answer in principle your question "How *possibly* can Candidate B be elected without counting those 3476 voters' individual votes a little more (like 17% more) than how much the votes were counted from the 4064 voters preferring Candidate A?" Just FYI, in the U.S. there have been over 500 RCV elections that FairVote has tracked and analyzed. I read from someone else that now the number is more than 800, I just haven't yet seen a good consistent searchable database online. Maybe one exists, I just haven't seen it yet. Of the 500 RCV elections over 300 had two or fewer candidates, so RCV does nothing at all in those elections differently than FPTP. Of the 200 that had three or more candidates, more than half had one of the candidates with more than 50% of the vote in the first round, so again RCV does nothing different. Of the fewer than 100 left that had more than one round, all but 26 had elected the candidate with the most first-choice votes, so again, RCV did nothing different than FPTP. The remaining 26 had "come-from-behind" winners in which the RCV winner was the candidate in second place in the semifinal round, and that's when RCV did something different than FPTP. There were four RCV elections where the RCV winner was not the Condorcet winner. Two of the four had no Condorcet winner (they had a Rock-Paper-Scissors cycle, a Smith set of size 3). Those were Minneapolis City Council Ward 2 in 2021 and Oakland School Board District 4 in 2022. That leaves two RCV elections that *had* a Condorcet winner, but didn't elect the Condorcet winner: Burlington mayoral 2009 and Alaska at-large Representative to Congress in a Special Election in August 2022. Both of those elections were followed immediately by a serious repeal effort. In Burlington the repeal succeeded for 12 years (RCV has now returned to Burlington) and in Alaska the repeal effort failed by 0.2% margin when there was a 100-to-1 campaign spending ratio ($15 million spent to defeat repeal and $120,000 to support repeal of RCV). They are launching another petition drive to put repeal on the ballot again in 2026. When the CW is not elected, it's a close 3-way race and when it's not a cycle, it's the Center Squeeze effect. I wrote a paper about the the Burlington election where I simply replaced the hypotheticals of what happens when the CW is not elected with real names of real people and real numbers. It's not a particularly theoretical paper, more political and advocacy, but I try to lay down the principles and maybe channel the thoughts of Condorcet in the paper. And I happen to live in Burlington and voted in that election in 2009. Nic Tideman thought the paper was good enough for publication: https://link.springer.com/journal/10602/volumes-and-issues/34-3 but the edited published version gutted some content (mostly a table and figures with color), so I think the submitted version is better and I can share that to anyone without copyright violation: https://drive.google.com/file/d/1jIhFQfEoxSdyRz5SqEjZotbVDx4xshwM/view . > In the K-count, for Candidate B to be elected in this scenario, there would need to be a 3rd candidate (or multiple other candidates) to whom B was widely preferred but A was not. So, B would win because the people who favored A still preferred B to C, while the people who favored B preferred C to A. If you only look at the head-to-head votes of A vs. B, this seems anti-majoritarian, but the point I make in the paper is that you cannotmake valid inferences by decontextualizing the data like that, as doing so can lead you into the logical contradiction of a Condorcet cycle. It is in the very nature of multi-option preference aggregation that the data cannot be decomposed in this way. Another way of thinking about this is - suppose that while A is preferred to B, B is preferred to C, and C is preferred to A, so you have a classic Condorcet cycle. Then, someone must be declared the winner, so in your reasoning, someone's votes will be counted for more than someone else's. And, when resolving this issue, most Condorcet methods will look at the margins of victory, even though they are ignored in the case when a Condorcet winner exists. But if margins matter enough to decide a winner when no Condorcet winner exists, why is it okay to completely ignore them when a Condorcet winner does exist? > > The K-count is a way of trying to reconcile Condorcet's conception of majority rule, which looks for majority in terms of each head-to-head matchup, with Borda's conception of majority rule, which seeks to honor the maximum number of individual pairwise preferences. > L8r, robert -- r b-j . _ . _ . _ . _ rbj@audioimagination.com "Imagination is more important than knowledge." . . .
Ábel Stankovics
Mon, May 19, 2025 10:34 AM

"This is the heart of the issue with the Condorcet winner criteria - if a
Condorcet winner exists, a Condorcet method must completely ignore the
size of the margins of victory, no matter how large. In my view, this
curtails the meaning of 'majority rule' in a way that feels undemocratic."

I would argue that this does not curtail the meaning of majority rule, it
IS majority rule. By taking into the size of the other victories in this
case it would be something other than majority rule, maybe a "compromise"
rule, maybe something else. Note that "majority rule" (between more than 2
alternatives, as in "the will of the majorities") is not the same as "the
will of THE majority". There is a majority, when there is a faction of more
than 50%, that's when there is such a thing as "the will of the majority".
When there is no such clear majority, Condorcet allows for different
majorities to make up the difference by unanimity. To take into account the
strength of victories when there is unanimity of majorities, is (no matter
if somewhat tautological) it would not really be accurate to call "majority
rule". Similarly, in the cardinal paradigm, say Approval voting is not
majority rule, nor does it aspire to find the "the will of the majority"
(although the majority faction can force a winner of course) - it allows
for different minorities to come together and elect someone with a
plurality (also sort of compromising, and Approval is not only cardinal, it
is also a very restricted sort of ordinal system, with only 2 ranks
allowed). In Score, it is also not majority rule nor "the will of the
majority", but a plurality of cardinal-preference utilities (it is NOT
majoritarian and I think people who think in the cardinal paradigm look at
this as an advantage just as much as people in the Condorcet paradigm think
later-no-harm is not desirable). So is Borda, but it derives hypothetical
cardinal preferences more strictly, based on ordinal preferences. This
causes a high level of IIA problems.

In the cardinal paradigm, your argument for candidate A to be elected in
the example makes much more sense, since in the cardinal paradigm
preferences ARE intensities. But in the ordinal paradigm, preferences are
not intensities, but ranks, or boiled down to roots, pairwise comparisons.
If I prefer Z to A, then adding all other letters of the alphabet to the
race in-between does not make my preference stronger. So I don't really get
the intuition that all those unanimities in favor of A are at all relevant.
Yes, if I saw that in a real world election, I would also suspect they are
likely to be, but the real way to know whether they are is to embrace the
cardinal paradigm and let voters express it by themselves (with all the
questions of strategy and psychology that come with it). But if we are
still in the ordinal paradigm, nothing tells us that the size of those
victories is at all relevant, since for all we know, those are irrelevant
alternatives, or clones only running to help A. That's the weirdness of
Borda, it interprets ordinal as if were cardinal, which is far more
questionable than interpreting cardinal preferences as ordinal, for
example. But not only do we disagree whether is "feels undemocratic", but
also, by your own arguments, such intuition can be wrong.

"But if margins matter enough to decide a winner when no Condorcet winner
exists, why is it okay to completely ignore them when a Condorcet winner
does exist?"

It is a tiebreaker (well strictly speaking, only Smith methods are the
tiebreakers, other methods are tiebreakers that can give the win to those
behind the ties for first place). The same way are FPP is a tiebreaker for
unanimity or the absolute majority principle, or Condorcet is one for
either. You can imagine any sort of line of subsidiary rules from unanimity
to a Condorcet method. At some point, 2/3 supermajority was a subsidiary
rule for when there is no unanimity, absolute majority for when there is no
supermajority, plurality or Condorcet when there is no absolute majority,
and when there is no CW, or there is a tie for plurality, etc., then other
tiebreakers can be used.

I don't see how the Condorcet paradox alone is any argument against it's
concept of majority rule, just as Arrow's theory does not seem like an
argument against the unanimity principle.

On Mon, May 19, 2025 at 1:47 AM Daniel Kirslis via Election-Methods <
election-methods@lists.electorama.com> wrote:

Hi r b-j,

Thank you for this response. I want to address both of your principles.

First, is "one person, one vote". I of course agree completely that each
individual's vote should be treated exactly equally, and the K-count does
this. You say that "for any ranked ballot, this means that if Candidate A
is ranked higher than Candidate B then that is a vote for A... It doesn't
matter how many levels A is ranked higher than B, it counts as exactly one
vote for A." This is precisely how the K-count works - if A is ranked above
B on one ballot, then A advances by one along the 'preferred to B' axis.
The number of rankings between them is immaterial to A's position vis a vis
the B axis. However, if A is ranked above other candidates on that ballot,
A will also advance along those candidates' axes, so it is perhaps not
exactly "one vote". But each voter's vote has the same potential power.

To your second principle. You say "I cannot understand why, if a
Condorcet winner exists, how any other method; Hare, Borda, Bucklin, or
Kirslis is more democratic than Condorcet." Let me give an example to
illustrate, which relates to the principle of majority rule.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million
voters. Let us suppose that candidate A is unanimously preferred to every
other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses
by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other
candidate by the same 2 vote margin, and is thus very narrowly a Condorcet
winner. Does it really reflect the will of the majority better to declare
candidate Z the winner because of his extraordinarily narrow margin over
all of the opposition when candidate A is the unanimous favorite versus
everyone but Candidate Z, to whom she barely loses? Many more preferences
are violated by choosing the Condorcet winner in this case than
choosing candidate A. This is the heart of the issue with the Condorcet
winner criteria - if a Condorcet winner exists, a Condorcet method must completely
ignore the size of the margins of victory, no matter how large. In my view,
this curtails the meaning of 'majority rule' in a way that feels
undemocratic.

I am not familiar with the Burlington election that you reference, and I
will look into it when I have a chance. I don't know what the K-count would
decide in that case. But I can try to answer in principle your question
"How possibly can Candidate B be elected without counting those 3476
voters' individual votes a little more (like 17% more) than how much the
votes were counted from the 4064 voters preferring Candidate A?" In the
K-count, for Candidate B to be elected in this scenario, there would need
to be a 3rd candidate (or multiple other candidates) to whom B was widely
preferred but A was not. So, B would win because the people who favored A
still preferred B to C, while the people who favored B preferred C to A. If
you only look at the head-to-head votes of A vs. B, this seems
anti-majoritarian, but the point I make in the paper is that you cannot make
valid inferences by decontextualizing the data like that, as doing so can
lead you into the logical contradiction of a Condorcet cycle. It is in the
very nature of multi-option preference aggregation that the data cannot be
decomposed in this way. Another way of thinking about this is - suppose
that while A is preferred to B, B is preferred to C, and C is preferred to
A, so you have a classic Condorcet cycle. Then, someone must be declared
the winner, so in your reasoning, someone's votes will be counted for more
than someone else's. And, when resolving this issue, most Condorcet methods
will look at the margins of victory, even though they are ignored in the
case when a Condorcet winner exists. But if margins matter enough to decide
a winner when no Condorcet winner exists, why is it okay to completely
ignore them when a Condorcet winner does exist?

The K-count is a way of trying to reconcile Condorcet's conception of
majority rule, which looks for majority in terms of each head-to-head
matchup, with Borda's conception of majority rule, which seeks to honor the
maximum number of individual pairwise preferences.

Thanks again for your response, and thank you for looking over the paper.
I appreciate your civil tone and good faith questions, and I hope it is
clear that the discussion here is made with full respect and in a spirit of
friendly intellectual inquiry. And I welcome your response to these
arguments!

I am also considering the questions from other folks and am working on
responses to those as well.

On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via
Election-Methods election-methods@lists.electorama.com wrote:

Hi Dan,

I made one pass through your paper, but the interaction with Chris and
Andy was helpful.  I understand the definition of your K-count measure, but
still don't understand the motivation of it, solely from the POV of
democratic principles, which is where I draw my Condorcetist perspective.
Admittedly, I am a hard-core Condorcet advocate, but I am so because of
some basic principles.

I read your section 9 and re-read it, and I still cannot get past how it
justifies any non-Condorcet method (including your K-count) over
Condorcet.  The principles of free and fair elections in a democratic
context require, among other things, that our votes are valued equally:

 1. "One person, one vote": Every enfranchised voter has an equal

influence on
government in elections because of our inherent equality as citizens
and this is
independent of any utilitarian notion of personal investment in the
outcome. If I
enthusiastically prefer Candidate A and you prefer Candidate B only
tepidly, your
vote for Candidate B counts no less (nor more) than my vote for A. The
effectiveness of one's vote – how much their vote counts – is not
proportional to
their degree of preference but is determined only by their franchise.
A citizen with
franchise has a vote that counts equally as much as any other citizen
with
franchise. For any ranked ballot, this means that if Candidate A is
ranked higher
than Candidate B then that is a vote for A, if only candidates A and
B are
contending (such as in the IRV final round). It doesn't matter how
many levels A
is ranked higher than B, it counts as exactly one vote for A.

If our votes are not valued equally, then I want my vote to count more
than yours.  If that is unacceptable (understandably) then we must agree to
count our votes equally.  In the U.S., too many people have died over that
inequality.  So then, in order for our votes to be valued equally, we must
have Majority Rule in single-winner elections:

 2. Majority rule: If more voters mark their ballots preferring

Candidate A over
Candidate B than the number of voters marking their ballots to the
contrary,
then Candidate B is not elected. If Candidate B were to be elected,
that would
mean that the fewer voters preferring Candidate B had cast votes that
had greater
value and counted more than those votes from voters of the larger set
preferring
Candidate A.

Those are two ways of, essentially, expressing the same principle in
single-winner elections.  For multi-winner elections, the way to value our
votes equally would be Proportional Representation, but I don't wanna go
there in this discussion.  I would like to stay with single-winner
elections.

Now, of course this doesn't deal with the problem of cycles and we can
discuss what the best and most democratic way to deal with cycles is, but I
cannot understand why, if a Condorcet winner exists, how any other
method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet.

If a CW exists and we know (from the Cast Vote Record having ranked
ballot data) that the CW exists and who that CW is, how is electing the
K-count winner, assuming they're different from the CW, more democratic?
Just like with the IRV failures, we will know that a smaller set of
voters have left that election satisfied than that of a larger set of
voters leaving the election dissatisfied.  We will know that the votes
coming from that smaller set of voters were more effective in electing
their preferred candidate than the votes coming from the larger set of
voters that not only preferred someone else, but they preferred a
specific candidate over the one who Kirslis elected and marked their
ballots saying so.  For the very same reason that IRV failed in Burlington
Vermont in 2009 or in Alaska in August 2022, the elected candidate will
suffer a sense of loss of legitimacy in the election.

In Burlington in 2009, 4064 voters marked their ballots that Candidate A
was a better choice than Candidate B and 3476 voters marked their ballots
to the contrary.  (There were 1436 voters that didn't like either A or B
and didn't rank either.)  How possibly can Candidate B be elected without
counting those 3476 voters' individual votes a little more (like 17% more)
than how much the votes were counted from the 4064 voters preferring
Candidate A?

Now this is a failure of Hare (IRV) but I can construct the very same
question for an election decided with Kirslis rules that failed to elect
the CW when such exists.  How would you answer that question?  How do you
justify satisfying a smaller set of voters at the expense of a larger set
of voters that preferred, not just anyone else, but a specific candidate
over the Kirslis winner?  I couldn't glean an answer to that from section 9
(or anywhere else) in your paper.

bestest,

--

r b-j . _ . _ . _ . _ rbj@audioimagination.com

"Imagination is more important than knowledge."

.
.
.

On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods <

Hi all,

Thanks so much for the replies. I’ll respond to everyone in this thread.

Andy - I really appreciate your feedback. Your summary is correct, and

your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of
thinking about it that I had not considered. It seems like a potentially
fruitful lens for understanding it. And, as perhaps you have surmised, I
may have been mistaken in the statement about the sincere favorite
criteria, but I am working on an analysis of the issue that I will share.

Toby, making a short summary is a great suggestion. The argument in the

paper is admittedly a bit convoluted before it presents the actual method.
Here is the simplified way that I would explain it:

Each voter ranks their preferences, with ties allowed and unranked

candidates treated as last-place preferences. Then, for each candidate, you
make a plot, where each axis is the total number of times that they were
preferred to each of their opponents. So, if the candidates are A, B, and
C, candidate A’s plot would have “number of times preferred to B” on one
axis and “number of times preferred to C” on the other axis. Candidate B &
C could be plotted similarly in terms of their opponents. The winner is
simply the candidate who is plotted the farthest up and to the right, or
closest to topmost and rightmost point, which is where a candidate who is
the unanimous first-place choice would be plotted. The distance from that
point is calculated using the Pythagorean theorem, which is where
minimizing the sum of squares that Andy referenced comes in.

The figures in the paper tell the story better than the words, as it is

essentially a geometric idea. And, sections 4, 5, and 6 can really be
skipped - they are more about justifying the approach than explaining it.

Chris, you asked “Why should we be interested in the "concerns" of

Borda (whatever they are)? And so much that we should embrace a method that
fails the Condorcet criterion?” Great question. If you look at the Stanford
Encyclopedia of Philosophy’s entry on Social Choice Theory, they list
Condorcet and Borda as the original pioneers of this thinking (
https://plato.stanford.edu/entries/social-choice/). Borda thinks about
majoritarianism in terms of votes, while Condorcet thinks about it in terms
of voters. Obviously, in FPP elections, these are the same, but the heart
of the interest in these questions comes from the tension that arises
between them in a ranked-choice setting, where each voter has multiple
votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a
thinker who studies these issues and has argued most persuasively for
Borda’s approach over Condorcet methods. In section 9 of my paper, I
explain some of my philosophical objections to the Condorcet winner
criterion.

You also asked “Do you propose allowing above-bottom equal ranking or

truncation?” Equal ranking is allowed, and unranked candidates are treated
as last place.

And, I am afraid I may have actually been mistaken about the sincere

favorite property, so will have to disappoint you there.

You asked “Who does your method elect in this example?

46 A
44 B>C
10 C”

If I am understanding your notation correctly, A would win in this

example. The full ranking would be:

A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2))
B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2))
C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2))

As you can see, when a candidate only appears as a first-place or

last-place preference, their K-count is simply equal to the number of
voters ranking them first.

Thanks all!

On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) <

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the candidate

with the smallest sum of SQUARES of non-victories (defeats plus ties)
against their opponents.

Taking the square root and dividing can make it meaningful by scaling

it to [0,1] or [0,s] (where s is the number of voters), but doesn't change
the finish order.

It does seem like an interesting attempt to "square the circle"

(great pun) and compromise between Borda and Condorcet. I hadn't realized
that Borda and Minimax are minimizing the one-norm and infinity-norm in the
same geometric space. The two-norm certainly seems like it should be
explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via

Election-Methods election-methods@lists.electorama.com wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this

message violates any norms or protocols that the members of this list
adhere to.

I have recently developed a novel method for tabulating

ranked-choice elections that attempts to reconcile the concerns of Borda
and Condorcet. I believe that it maintains the simplicity and mathematical
elegance of the Borda count while incorporating Condorcet's concern with
pairwise dominance. Intuitively, it can be understood as ordering
candidates by how close they come to being unanimously selected when
plotted in Cartesian coordinate space. Here is a link to the paper:

Given its simplicity, I have been very surprised to discover that

this method has never been proposed before. I am hoping that some of you
all will take a look at the paper and share your comments, questions, and
critiques. Ultimately, it is my hope that ranked-choice voting advocates
can arrive at a consensus about the best method for RCV and thus strengthen
efforts to adopt it and deliver much needed democratic improvements. But
even if you don't find the system itself compelling, you may find the
method of plotting electoral outcomes elucidated in the paper to be useful
for the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - see https://electorama.com/em for list

info

Election-Methods mailing list - see https://electorama.com/em for list
info


Election-Methods mailing list - see https://electorama.com/em for list
info

"This is the heart of the issue with the Condorcet winner criteria - if a Condorcet winner exists, a Condorcet method *must* completely ignore the size of the margins of victory, no matter how large. In my view, this curtails the meaning of 'majority rule' in a way that feels undemocratic." I would argue that this does not curtail the meaning of majority rule, it IS majority rule. By taking into the size of the other victories in this case it would be something other than majority rule, maybe a "compromise" rule, maybe something else. Note that "majority rule" (between more than 2 alternatives, as in "the will of the majorities") is not the same as "the will of THE majority". There is a majority, when there is a faction of more than 50%, that's when there is such a thing as "the will of the majority". When there is no such clear majority, Condorcet allows for different majorities to make up the difference by unanimity. To take into account the strength of victories when there is unanimity of majorities, is (no matter if somewhat tautological) it would not really be accurate to call "majority rule". Similarly, in the cardinal paradigm, say Approval voting is not majority rule, nor does it aspire to find the "the will of the majority" (although the majority faction can force a winner of course) - it allows for different minorities to come together and elect someone with a plurality (also sort of compromising, and Approval is not only cardinal, it is also a very restricted sort of ordinal system, with only 2 ranks allowed). In Score, it is also not majority rule nor "the will of the majority", but a plurality of cardinal-preference utilities (it is NOT majoritarian and I think people who think in the cardinal paradigm look at this as an advantage just as much as people in the Condorcet paradigm think later-no-harm is not desirable). So is Borda, but it derives hypothetical cardinal preferences more strictly, based on ordinal preferences. This causes a high level of IIA problems. In the cardinal paradigm, your argument for candidate A to be elected in the example makes much more sense, since in the cardinal paradigm preferences ARE intensities. But in the ordinal paradigm, preferences are not intensities, but ranks, or boiled down to roots, pairwise comparisons. If I prefer Z to A, then adding all other letters of the alphabet to the race in-between does not make my preference stronger. So I don't really get the intuition that all those unanimities in favor of A are at all relevant. Yes, if I saw that in a real world election, I would also suspect they are likely to be, but the real way to know whether they are is to embrace the cardinal paradigm and let voters express it by themselves (with all the questions of strategy and psychology that come with it). But if we are still in the ordinal paradigm, nothing tells us that the size of those victories is at all relevant, since for all we know, those are irrelevant alternatives, or clones only running to help A. That's the weirdness of Borda, it interprets ordinal as if were cardinal, which is far more questionable than interpreting cardinal preferences as ordinal, for example. But not only do we disagree whether is "feels undemocratic", but also, by your own arguments, such intuition can be wrong. "But if margins matter enough to decide a winner when no Condorcet winner exists, why is it okay to completely ignore them when a Condorcet winner does exist?" It is a tiebreaker (well strictly speaking, only Smith methods are the tiebreakers, other methods are tiebreakers that can give the win to those behind the ties for first place). The same way are FPP is a tiebreaker for unanimity or the absolute majority principle, or Condorcet is one for either. You can imagine any sort of line of subsidiary rules from unanimity to a Condorcet method. At some point, 2/3 supermajority was a subsidiary rule for when there is no unanimity, absolute majority for when there is no supermajority, plurality or Condorcet when there is no absolute majority, and when there is no CW, or there is a tie for plurality, etc., then other tiebreakers can be used. I don't see how the Condorcet paradox alone is any argument against it's concept of majority rule, just as Arrow's theory does not seem like an argument against the unanimity principle. On Mon, May 19, 2025 at 1:47 AM Daniel Kirslis via Election-Methods < election-methods@lists.electorama.com> wrote: > Hi r b-j, > > Thank you for this response. I want to address both of your principles. > > First, is "one person, one vote". I of course agree completely that each > individual's vote should be treated exactly equally, and the K-count does > this. You say that "for any ranked ballot, this means that if Candidate A > is ranked higher than Candidate B then that is a vote for A... It doesn't > matter how many levels A is ranked higher than B, it counts as exactly one > vote for A." This is precisely how the K-count works - if A is ranked above > B on one ballot, then A advances by one along the 'preferred to B' axis. > The number of rankings between them is immaterial to A's position vis a vis > the B axis. However, if A is ranked above other candidates on that ballot, > A will also advance along those candidates' axes, so it is perhaps not > exactly "one vote". But each voter's vote has the same potential power. > > To your second principle. You say "I cannot understand why, *if* a > Condorcet winner exists, how *any* other method; Hare, Borda, Bucklin, or > Kirslis is more democratic than Condorcet." Let me give an example to > illustrate, which relates to the principle of majority rule. > > Imagine an election with 26 candidates, A, B, C... Z, and 1 million > voters. Let us suppose that candidate A is unanimously preferred to every > other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses > by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other > candidate by the same 2 vote margin, and is thus very narrowly a Condorcet > winner. Does it really reflect the will of the majority better to declare > candidate Z the winner because of his extraordinarily narrow margin over > all of the opposition when candidate A is the unanimous favorite versus > everyone but Candidate Z, to whom she barely loses? Many more preferences > are violated by choosing the Condorcet winner in this case than > choosing candidate A. This is the heart of the issue with the Condorcet > winner criteria - if a Condorcet winner exists, a Condorcet method *must* completely > ignore the size of the margins of victory, no matter how large. In my view, > this curtails the meaning of 'majority rule' in a way that feels > undemocratic. > > I am not familiar with the Burlington election that you reference, and I > will look into it when I have a chance. I don't know what the K-count would > decide in that case. But I can try to answer in principle your question > "How *possibly* can Candidate B be elected without counting those 3476 > voters' individual votes a little more (like 17% more) than how much the > votes were counted from the 4064 voters preferring Candidate A?" In the > K-count, for Candidate B to be elected in this scenario, there would need > to be a 3rd candidate (or multiple other candidates) to whom B was widely > preferred but A was not. So, B would win because the people who favored A > still preferred B to C, while the people who favored B preferred C to A. If > you only look at the head-to-head votes of A vs. B, this seems > anti-majoritarian, but the point I make in the paper is that you cannot make > valid inferences by decontextualizing the data like that, as doing so can > lead you into the logical contradiction of a Condorcet cycle. It is in the > very nature of multi-option preference aggregation that the data cannot be > decomposed in this way. Another way of thinking about this is - suppose > that while A is preferred to B, B is preferred to C, and C is preferred to > A, so you have a classic Condorcet cycle. Then, someone must be declared > the winner, so in your reasoning, someone's votes will be counted for more > than someone else's. And, when resolving this issue, most Condorcet methods > will look at the margins of victory, even though they are ignored in the > case when a Condorcet winner exists. But if margins matter enough to decide > a winner when no Condorcet winner exists, why is it okay to completely > ignore them when a Condorcet winner does exist? > > The K-count is a way of trying to reconcile Condorcet's conception of > majority rule, which looks for majority in terms of each head-to-head > matchup, with Borda's conception of majority rule, which seeks to honor the > maximum number of individual pairwise preferences. > > Thanks again for your response, and thank you for looking over the paper. > I appreciate your civil tone and good faith questions, and I hope it is > clear that the discussion here is made with full respect and in a spirit of > friendly intellectual inquiry. And I welcome your response to these > arguments! > > I am also considering the questions from other folks and am working on > responses to those as well. > > On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via > Election-Methods <election-methods@lists.electorama.com> wrote: > >> >> Hi Dan, >> >> I made one pass through your paper, but the interaction with Chris and >> Andy was helpful. I understand the definition of your K-count measure, but >> still don't understand the motivation of it, solely from the POV of >> democratic principles, which is where I draw my Condorcetist perspective. >> Admittedly, I am a hard-core Condorcet advocate, but I am so because of >> some basic principles. >> >> I read your section 9 and re-read it, and I still cannot get past how it >> justifies *any* non-Condorcet method (including your K-count) over >> Condorcet. The principles of free and fair elections in a democratic >> context require, among other things, that our votes are valued equally: >> >> 1. "One person, one vote": Every enfranchised voter has an equal >> influence on >> government in elections because of our inherent equality as citizens >> and this is >> independent of any utilitarian notion of personal investment in the >> outcome. If I >> enthusiastically prefer Candidate A and you prefer Candidate B only >> tepidly, your >> vote for Candidate B counts no less (nor more) than my vote for A. The >> effectiveness of one's vote – how much their vote counts – is not >> proportional to >> their degree of preference but is determined only by their franchise. >> A citizen with >> franchise has a vote that counts equally as much as any other citizen >> with >> franchise. For any ranked ballot, this means that if Candidate A is >> ranked higher >> than Candidate B then that is a vote for A, if only candidates A and >> B are >> contending (such as in the IRV final round). It doesn't matter how >> many levels A >> is ranked higher than B, it counts as exactly one vote for A. >> >> If our votes are not valued equally, then I want my vote to count more >> than yours. If that is unacceptable (understandably) then we must agree to >> count our votes equally. In the U.S., too many people have died over that >> inequality. So then, in order for our votes to be valued equally, we must >> have Majority Rule in single-winner elections: >> >> 2. Majority rule: If more voters mark their ballots preferring >> Candidate A over >> Candidate B than the number of voters marking their ballots to the >> contrary, >> then Candidate B is not elected. If Candidate B were to be elected, >> that would >> mean that the fewer voters preferring Candidate B had cast votes that >> had greater >> value and counted more than those votes from voters of the larger set >> preferring >> Candidate A. >> >> Those are two ways of, essentially, expressing the same principle in >> single-winner elections. For multi-winner elections, the way to value our >> votes equally would be Proportional Representation, but I don't wanna go >> there in this discussion. I would like to stay with single-winner >> elections. >> >> Now, of course this doesn't deal with the problem of cycles and we can >> discuss what the best and most democratic way to deal with cycles is, but I >> cannot understand why, *if* a Condorcet winner exists, how *any* other >> method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet. >> >> If a CW exists and we *know* (from the Cast Vote Record having ranked >> ballot data) that the CW exists and who that CW is, how is electing the >> K-count winner, assuming they're different from the CW, more democratic? >> Just like with the IRV failures, we will *know* that a smaller set of >> voters have left that election satisfied than that of a larger set of >> voters leaving the election dissatisfied. We will know that the votes >> coming from that smaller set of voters were more effective in electing >> their preferred candidate than the votes coming from the larger set of >> voters that not only preferred someone else, but they preferred a >> *specific* candidate over the one who Kirslis elected and marked their >> ballots saying so. For the very same reason that IRV failed in Burlington >> Vermont in 2009 or in Alaska in August 2022, the elected candidate will >> suffer a sense of loss of legitimacy in the election. >> >> In Burlington in 2009, 4064 voters marked their ballots that Candidate A >> was a better choice than Candidate B and 3476 voters marked their ballots >> to the contrary. (There were 1436 voters that didn't like either A or B >> and didn't rank either.) How *possibly* can Candidate B be elected without >> counting those 3476 voters' individual votes a little more (like 17% more) >> than how much the votes were counted from the 4064 voters preferring >> Candidate A? >> >> Now this is a failure of Hare (IRV) but I can construct the very same >> question for an election decided with Kirslis rules that failed to elect >> the CW when such exists. How would you answer that question? How do you >> justify satisfying a smaller set of voters at the expense of a larger set >> of voters that preferred, not just anyone else, but a specific candidate >> over the Kirslis winner? I couldn't glean an answer to that from section 9 >> (or anywhere else) in your paper. >> >> bestest, >> >> -- >> >> r b-j . _ . _ . _ . _ rbj@audioimagination.com >> >> "Imagination is more important than knowledge." >> >> . >> . >> . >> >> > On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods < >> election-methods@lists.electorama.com> wrote: >> > >> > >> > Hi all, >> > >> > Thanks so much for the replies. I’ll respond to everyone in this thread. >> > >> > Andy - I really appreciate your feedback. Your summary is correct, and >> your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of >> thinking about it that I had not considered. It seems like a potentially >> fruitful lens for understanding it. And, as perhaps you have surmised, I >> may have been mistaken in the statement about the sincere favorite >> criteria, but I am working on an analysis of the issue that I will share. >> > >> > Toby, making a short summary is a great suggestion. The argument in the >> paper is admittedly a bit convoluted before it presents the actual method. >> Here is the simplified way that I would explain it: >> > >> > Each voter ranks their preferences, with ties allowed and unranked >> candidates treated as last-place preferences. Then, for each candidate, you >> make a plot, where each axis is the total number of times that they were >> preferred to each of their opponents. So, if the candidates are A, B, and >> C, candidate A’s plot would have “number of times preferred to B” on one >> axis and “number of times preferred to C” on the other axis. Candidate B & >> C could be plotted similarly in terms of their opponents. The winner is >> simply the candidate who is plotted the farthest up and to the right, or >> closest to topmost and rightmost point, which is where a candidate who is >> the unanimous first-place choice would be plotted. The distance from that >> point is calculated using the Pythagorean theorem, which is where >> minimizing the sum of squares that Andy referenced comes in. >> > >> > The figures in the paper tell the story better than the words, as it is >> essentially a geometric idea. And, sections 4, 5, and 6 can really be >> skipped - they are more about justifying the approach than explaining it. >> > >> > Chris, you asked “Why should we be interested in the "concerns" of >> Borda (whatever they are)? And so much that we should embrace a method that >> fails the Condorcet criterion?” Great question. If you look at the Stanford >> Encyclopedia of Philosophy’s entry on Social Choice Theory, they list >> Condorcet and Borda as the original pioneers of this thinking ( >> https://plato.stanford.edu/entries/social-choice/). Borda thinks about >> majoritarianism in terms of votes, while Condorcet thinks about it in terms >> of voters. Obviously, in FPP elections, these are the same, but the heart >> of the interest in these questions comes from the tension that arises >> between them in a ranked-choice setting, where each voter has multiple >> votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a >> thinker who studies these issues and has argued most persuasively for >> Borda’s approach over Condorcet methods. In section 9 of my paper, I >> explain some of my philosophical objections to the Condorcet winner >> criterion. >> > >> > You also asked “Do you propose allowing above-bottom equal ranking or >> truncation?” Equal ranking is allowed, and unranked candidates are treated >> as last place. >> > >> > And, I am afraid I may have actually been mistaken about the sincere >> favorite property, so will have to disappoint you there. >> > >> > You asked “Who does your method elect in this example? >> > >> > 46 A >> > 44 B>C >> > 10 C” >> > >> > If I am understanding your notation correctly, A would win in this >> example. The full ranking would be: >> > A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2)) >> > B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2)) >> > C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2)) >> > >> > As you can see, when a candidate only appears as a first-place or >> last-place preference, their K-count is simply equal to the number of >> voters ranking them first. >> > >> > Thanks all! >> > >> > >> > On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) < >> elections@jenningsstory.com> wrote: >> > > Hi Dan, >> > > >> > > Great paper. Thank you for posting! >> > > >> > > It seems like the short version is that the winner is the candidate >> with the smallest sum of SQUARES of non-victories (defeats plus ties) >> against their opponents. >> > > >> > > Taking the square root and dividing can make it meaningful by scaling >> it to [0,1] or [0,s] (where s is the number of voters), but doesn't change >> the finish order. >> > > >> > > >> > > It does seem like an interesting attempt to "square the circle" >> (great pun) and compromise between Borda and Condorcet. I hadn't realized >> that Borda and Minimax are minimizing the one-norm and infinity-norm in the >> same geometric space. The two-norm certainly seems like it should be >> explored. >> > > >> > > I would love to see the proof of non-favorite-betrayal. >> > > >> > > Best, >> > > >> > > ~ Andy >> > > On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via >> Election-Methods <election-methods@lists.electorama.com> wrote: >> > > >> > > > Hello! >> > > > >> > > > I am a newcomer to this mailing list, so please forgive me if this >> message violates any norms or protocols that the members of this list >> adhere to. >> > > > >> > > > I have recently developed a novel method for tabulating >> ranked-choice elections that attempts to reconcile the concerns of Borda >> and Condorcet. I believe that it maintains the simplicity and mathematical >> elegance of the Borda count while incorporating Condorcet's concern with >> pairwise dominance. Intuitively, it can be understood as ordering >> candidates by how close they come to being unanimously selected when >> plotted in Cartesian coordinate space. Here is a link to the paper: >> > > > >> https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing >> > > > >> > > > Given its simplicity, I have been very surprised to discover that >> this method has never been proposed before. I am hoping that some of you >> all will take a look at the paper and share your comments, questions, and >> critiques. Ultimately, it is my hope that ranked-choice voting advocates >> can arrive at a consensus about the best method for RCV and thus strengthen >> efforts to adopt it and deliver much needed democratic improvements. But >> even if you don't find the system itself compelling, you may find the >> method of plotting electoral outcomes elucidated in the paper to be useful >> for the analysis of other electoral systems. >> > > > >> > > > Thank you! >> > > > >> > > > -Dan >> > > >> > > >> > ---- >> > Election-Methods mailing list - see https://electorama.com/em for list >> info >> ---- >> Election-Methods mailing list - see https://electorama.com/em for list >> info >> > ---- > Election-Methods mailing list - see https://electorama.com/em for list > info >
CB
Chris Benham
Mon, May 19, 2025 4:31 PM

It seems like the short version is that the winner is the candidate
with the smallest sum of SQUARES of non-victories (defeats plus ties)
against their opponents.

I take that these numbers you are squaring are the candidate's opposing
and tying vote scores, and not simply the number of such results. Is
that right?

Because otherwise that would often be very indecisive, like Copeland.

On 19/05/2025 1:40 am, Andrew B Jennings (elections) via
Election-Methods wrote:

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the candidate
with the smallest sum of SQUARES of non-victories (defeats plus ties)
against their opponents.

Taking the square root and dividing can make it meaningful by scaling
it to [0,1] or [0,s] (where s is the number of voters), but doesn't
change the finish order.

It does seem like an interesting attempt to "square the circle" (great
pun) and compromise between Borda and Condorcet. I hadn't realized
that Borda and Minimax are minimizing the one-norm and infinity-norm
in the same geometric space. The two-norm certainly seems like it
should be explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via
Election-Methods election-methods@lists.electorama.com wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this
message violates any norms or protocols that the members of this list
adhere to.

I have recently developed a novel method for tabulating ranked-choice
elections that attempts to reconcile the concerns of Borda and
Condorcet. I believe that it maintains the simplicity and
mathematical elegance of the Borda count while incorporating
Condorcet's concern with pairwise dominance. Intuitively, it can be
understood as ordering candidates by how close they come to being
unanimously selected when plotted in Cartesian coordinate space. Here
is a link to the paper:
https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing

Given its simplicity, I have been very surprised to discover that
this method has never been proposed before. I am hoping that some of
you all will take a look at the paper and share your comments,
questions, and critiques. Ultimately, it is my hope that
ranked-choice voting advocates can arrive at a consensus about the
best method for RCV and thus strengthen efforts to adopt it and
deliver much needed democratic improvements. But even if you don't
find the system itself compelling, you may find the method of
plotting electoral outcomes elucidated in the paper to be useful for
the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - seehttps://electorama.com/em for list info

> > It seems like the short version is that the winner is the candidate > with the smallest sum of SQUARES of non-victories (defeats plus ties) > against their opponents. I take that these numbers you are squaring are the candidate's opposing and tying vote scores, and not simply the number of such results. Is that right? Because otherwise that would often be very indecisive, like Copeland. On 19/05/2025 1:40 am, Andrew B Jennings (elections) via Election-Methods wrote: > Hi Dan, > > Great paper. Thank you for posting! > > It seems like the short version is that the winner is the candidate > with the smallest sum of SQUARES of non-victories (defeats plus ties) > against their opponents. > > Taking the square root and dividing can make it meaningful by scaling > it to [0,1] or [0,s] (where s is the number of voters), but doesn't > change the finish order. > > It does seem like an interesting attempt to "square the circle" (great > pun) and compromise between Borda and Condorcet. I hadn't realized > that Borda and Minimax are minimizing the one-norm and infinity-norm > in the same geometric space. The two-norm certainly seems like it > should be explored. > > I would love to see the proof of non-favorite-betrayal. > > Best, > > ~ Andy > On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via > Election-Methods <election-methods@lists.electorama.com> wrote: >> Hello! >> >> I am a newcomer to this mailing list, so please forgive me if this >> message violates any norms or protocols that the members of this list >> adhere to. >> >> I have recently developed a novel method for tabulating ranked-choice >> elections that attempts to reconcile the concerns of Borda and >> Condorcet. I believe that it maintains the simplicity and >> mathematical elegance of the Borda count while incorporating >> Condorcet's concern with pairwise dominance. Intuitively, it can be >> understood as ordering candidates by how close they come to being >> unanimously selected when plotted in Cartesian coordinate space. Here >> is a link to the paper: >> https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing >> >> Given its simplicity, I have been very surprised to discover that >> this method has never been proposed before. I am hoping that some of >> you all will take a look at the paper and share your comments, >> questions, and critiques. Ultimately, it is my hope that >> ranked-choice voting advocates can arrive at a consensus about the >> best method for RCV and thus strengthen efforts to adopt it and >> deliver much needed democratic improvements. But even if you don't >> find the system itself compelling, you may find the method of >> plotting electoral outcomes elucidated in the paper to be useful for >> the analysis of other electoral systems. >> >> Thank you! >> >> -Dan > > > ---- > Election-Methods mailing list - seehttps://electorama.com/em for list info
CB
Chris Benham
Mon, May 19, 2025 5:58 PM

Daniel,

In common with the pro-Borda minded, you seem to be making the
completely unjustified assumption that the multiple candidates are more
or less equidistant from each other in "issue space" and so it's ok
infer some maybe-sincere ratings from rankings.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million
voters. Let us suppose that candidate A is unanimously preferred to
every other candidate, 1,000,000 to 0, except for candidate Z, to whom
she loses by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats
every other candidate by the same 2 vote margin, and is thus very
narrowly a Condorcet winner. Does it really reflect the will of the
majority better to declare candidate Z the winner because of his
extraordinarily narrow margin over all of the opposition when
candidate A is the unanimous favorite versus everyone but Candidate Z,
to whom she barely loses?

Yes. The other (related) thing you seem to have in common with them is
obliviousness to Clones.  Like Borda, I am sure your method fails Clone
Independence (but maybe less egregiously).

With only ranking information, other things being equal, I don't see any
justification for rejecting Condorcet (or Smith).  Based on positional
information we can sometimes guess that some other candidate is higher
Social Utility, but probably not in a way that is reliable or isn't very
vulnerable to strategy.

For example say this is an election for a seat in the House of
Representatives in Australia which uses compulsory full strict ranking Hare:

49 A>C>B
48 B>C>A
03 C>A>B

The A and B supporters very likely only ranked C because they were
forced to fully rank.  C is the voted Condorcet winner, but it would
never cross anyone's mind in Australia that C should be the winner.  In
some places C might have struggled to get on the ballot, and in
Australia would be in danger of forfeiting his or her cash deposit (for
not getting a high enough percentage of the "primary vote".)

If truncation was allowed (as I think it should be) then most likely the
A and B voters would have truncated and A would be the voted CW  (A>B
51-49,  A>C 49-3).

But aside from that by far the main reason why a method that fails
Condorcet might be acceptable is that the Condorcet criterion is
incompatible with other criteria that people like.  Because Condorcet is
incompatible with Later-no-Help all Condorcet methods are vulnerable (to
varying degrees) to Burial strategy.

It's a bit like comparing two engines, one performs perfectly with clean
pure fuel but very badly with dirty impure fuel and another that doesn't
do quite as well with clean fuel but copes quite a bit better with dirty
fuel.  I'm thinking of course of the comparison between a Condorcet
method and Hare.

Chris

On 19/05/2025 9:16 am, Daniel Kirslis via Election-Methods wrote:

Hi r b-j,

Thank you for this response. I want to address both of your principles.

First, is "one person, one vote". I of course agree completely that
each individual's vote should be treated exactly equally, and the
K-count does this. You say that "for any ranked ballot, this means
that if Candidate A is ranked higher than Candidate B then that is a
vote for A... It doesn't matter how many levels A is ranked higher
than B, it counts as exactly one vote for A." This is precisely how
the K-count works - if A is ranked above B on one ballot, then A
advances by one along the 'preferred to B' axis. The number of
rankings between them is immaterial to A's position vis a vis the B
axis. However, if A is ranked above other candidates on that ballot, A
will also advance along those candidates' axes, so it is perhaps not
exactly "one vote". But each voter's vote has the same potential power.

To your second principle. You say "I cannot understand why, if a
Condorcet winner exists, how any other method; Hare, Borda, Bucklin,
or Kirslis is more democratic than Condorcet." Let me give an example
to illustrate, which relates to the principle of majority rule.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million
voters. Let us suppose that candidate A is unanimously preferred to
every other candidate, 1,000,000 to 0, except for candidate Z, to whom
she loses by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats
every other candidate by the same 2 vote margin, and is thus very
narrowly a Condorcet winner. Does it really reflect the will of the
majority better to declare candidate Z the winner because of his
extraordinarily narrow margin over all of the opposition when
candidate A is the unanimous favorite versus everyone but Candidate Z,
to whom she barely loses? Many more preferences are violated by
choosing the Condorcet winner in this case than choosing candidate A.
This is the heart of the issue with the Condorcet winner criteria - if
a Condorcet winner exists, a Condorcet method must completely ignore
the size of the margins of victory, no matter how large. In my view,
this curtails the meaning of 'majority rule' in a way that feels
undemocratic.

I am not familiar with the Burlington election that you reference, and
I will look into it when I have a chance. I don't know what the
K-count would decide in that case. But I can try to answer in
principle your question "How possibly can Candidate B be elected
without counting those 3476 voters' individual votes a little more
(like 17% more) than how much the votes were counted from the 4064
voters preferring Candidate A?" In the K-count, for Candidate B to be
elected in this scenario, there would need to be a 3rd candidate (or
multiple other candidates) to whom B was widely preferred but A was
not. So, B would win because the people who favored A still preferred
B to C, while the people who favored B preferred C to A. If you only
look at the head-to-head votes of A vs. B, this seems
anti-majoritarian, but the point I make in the paper is that you
cannot**make valid inferences by decontextualizing the data like that,
as doing so can lead you into the logical contradiction of a Condorcet
cycle. It is in the very nature of multi-option preference aggregation
that the data cannot be decomposed in this way. Another way of
thinking about this is - suppose that while A is preferred to B, B is
preferred to C, and C is preferred to A, so you have a classic
Condorcet cycle. Then, someone must be declared the winner, so in your
reasoning, someone's votes will be counted for more than someone
else's. And, when resolving this issue, most Condorcet methods will
look at the margins of victory, even though they are ignored in the
case when a Condorcet winner exists. But if margins matter enough to
decide a winner when no Condorcet winner exists, why is it okay to
completely ignore them when a Condorcet winner does exist?

The K-count is a way of trying to reconcile Condorcet's conception of
majority rule, which looks for majority in terms of each head-to-head
matchup, with Borda's conception of majority rule, which seeks to
honor the maximum number of individual pairwise preferences.

Thanks again for your response, and thank you for looking over the
paper. I appreciate your civil tone and good faith questions, and I
hope it is clear that the discussion here is made with full respect
and in a spirit of friendly intellectual inquiry. And I welcome your
response to these arguments!

I am also considering the questions from other folks and am working on
responses to those as well.

On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via
Election-Methods election-methods@lists.electorama.com wrote:

 Hi Dan,

 I made one pass through your paper, but the interaction with Chris
 and Andy was helpful.  I understand the definition of your K-count
 measure, but still don't understand the motivation of it, solely
 from the POV of democratic principles, which is where I draw my
 Condorcetist perspective.  Admittedly, I am a hard-core Condorcet
 advocate, but I am so because of some basic principles.

 I read your section 9 and re-read it, and I still cannot get past
 how it justifies *any* non-Condorcet method (including your
 K-count) over Condorcet.  The principles of free and fair
 elections in a democratic context require, among other things,
 that our votes are valued equally:

     1. "One person, one vote": Every enfranchised voter has an
 equal influence on
     government in elections because of our inherent equality as
 citizens and this is
     independent of any utilitarian notion of personal investment
 in the outcome. If I
     enthusiastically prefer Candidate A and you prefer Candidate B
 only tepidly, your
     vote for Candidate B counts no less (nor more) than my vote
 for A. The
     effectiveness of one's vote – how much their vote counts – is
 not proportional to
     their degree of preference but is determined only by their
 franchise. A citizen with
     franchise has a vote that counts equally as much as any other
 citizen with
     franchise. For any ranked ballot, this means that if Candidate
 A is ranked higher
     than Candidate B then that is a vote for A, if only candidates
 A and B are
     contending (such as in the IRV final round). It doesn't matter
 how many levels A
     is ranked higher than B, it counts as exactly one vote for A.

 If our votes are not valued equally, then I want my vote to count
 more than yours.  If that is unacceptable (understandably) then we
 must agree to count our votes equally.  In the U.S., too many
 people have died over that inequality.  So then, in order for our
 votes to be valued equally, we must have Majority Rule in
 single-winner elections:

     2. Majority rule: If more voters mark their ballots preferring
 Candidate A over
     Candidate B than the number of voters marking their ballots to
 the contrary,
     then Candidate B is not elected. If Candidate B were to be
 elected, that would
     mean that the fewer voters preferring Candidate B had cast
 votes that had greater
     value and counted more than those votes from voters of the
 larger set preferring
     Candidate A.

 Those are two ways of, essentially, expressing the same principle
 in single-winner elections.  For multi-winner elections, the way
 to value our votes equally would be Proportional Representation,
 but I don't wanna go there in this discussion.  I would like to
 stay with single-winner elections.

 Now, of course this doesn't deal with the problem of cycles and we
 can discuss what the best and most democratic way to deal with
 cycles is, but I cannot understand why, *if* a Condorcet winner
 exists, how *any* other method; Hare, Borda, Bucklin, or Kirslis
 is more democratic than Condorcet.

 If a CW exists and we *know* (from the Cast Vote Record having
 ranked ballot data) that the CW exists and who that CW is, how is
 electing the K-count winner, assuming they're different from the
 CW, more democratic?  Just like with the IRV failures, we will
 *know* that a smaller set of voters have left that election
 satisfied than that of a larger set of voters leaving the election
 dissatisfied.  We will know that the votes coming from that
 smaller set of voters were more effective in electing their
 preferred candidate than the votes coming from the larger set of
 voters that not only preferred someone else, but they preferred a
 *specific* candidate over the one who Kirslis elected and marked
 their ballots saying so.  For the very same reason that IRV failed
 in Burlington Vermont in 2009 or in Alaska in August 2022, the
 elected candidate will suffer a sense of loss of legitimacy in the
 election.

 In Burlington in 2009, 4064 voters marked their ballots that
 Candidate A was a better choice than Candidate B and 3476 voters
 marked their ballots to the contrary.  (There were 1436 voters
 that didn't like either A or B and didn't rank either.)  How
 *possibly* can Candidate B be elected without counting those 3476
 voters' individual votes a little more (like 17% more) than how
 much the votes were counted from the 4064 voters preferring
 Candidate A?

 Now this is a failure of Hare (IRV) but I can construct the very
 same question for an election decided with Kirslis rules that
 failed to elect the CW when such exists.  How would you answer
 that question?  How do you justify satisfying a smaller set of
 voters at the expense of a larger set of voters that preferred,
 not just anyone else, but a specific candidate over the Kirslis
 winner?  I couldn't glean an answer to that from section 9 (or
 anywhere else) in your paper.

 bestest,

 --

 r b-j . _ . _ . _ . _ rbj@audioimagination.com

 "Imagination is more important than knowledge."

 .
 .
 .

On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods

 <election-methods@lists.electorama.com> wrote:

Hi all,

Thanks so much for the replies. I’ll respond to everyone in this

 thread.

Andy - I really appreciate your feedback. Your summary is

 correct, and your framing of it as one-norm vs. two-norm vs.
 infinity-norm is a way of thinking about it that I had not
 considered. It seems like a potentially fruitful lens for
 understanding it. And, as perhaps you have surmised, I may have
 been mistaken in the statement about the sincere favorite
 criteria, but I am working on an analysis of the issue that I will
 share.

Toby, making a short summary is a great suggestion. The argument

 in the paper is admittedly a bit convoluted before it presents the
 actual method. Here is the simplified way that I would explain it:

Each voter ranks their preferences, with ties allowed and

 unranked candidates treated as last-place preferences. Then, for
 each candidate, you make a plot, where each axis is the total
 number of times that they were preferred to each of their
 opponents. So, if the candidates are A, B, and C, candidate A’s
 plot would have “number of times preferred to B” on one axis and
 “number of times preferred to C” on the other axis. Candidate B &
 C could be plotted similarly in terms of their opponents. The
 winner is simply the candidate who is plotted the farthest up and
 to the right, or closest to topmost and rightmost point, which is
 where a candidate who is the unanimous first-place choice would be
 plotted. The distance from that point is calculated using the
 Pythagorean theorem, which is where minimizing the sum of squares
 that Andy referenced comes in.

The figures in the paper tell the story better than the words,

 as it is essentially a geometric idea. And, sections 4, 5, and 6
 can really be skipped - they are more about justifying the
 approach than explaining it.

Chris, you asked “Why should we be interested in the "concerns"

 of Borda (whatever they are)? And so much that we should embrace a
 method that fails the Condorcet criterion?” Great question. If you
 look at the Stanford Encyclopedia of Philosophy’s entry on Social
 Choice Theory, they list Condorcet and Borda as the original
 pioneers of this thinking
 (https://plato.stanford.edu/entries/social-choice/). Borda thinks
 about majoritarianism in terms of votes, while Condorcet thinks
 about it in terms of voters. Obviously, in FPP elections, these
 are the same, but the heart of the interest in these questions
 comes from the tension that arises between them in a ranked-choice
 setting, where each voter has multiple votes and ‘majoritarianism’
 is no longer simple to define. Don Saari is a thinker who studies
 these issues and has argued most persuasively for Borda’s approach
 over Condorcet methods. In section 9 of my paper, I explain some
 of my philosophical objections to the Condorcet winner criterion.

You also asked “Do you propose allowing above-bottom equal

 ranking or truncation?” Equal ranking is allowed, and unranked
 candidates are treated as last place.

And, I am afraid I may have actually been mistaken about the

 sincere favorite property, so will have to disappoint you there.

You asked “Who does your method elect in this example?

46 A
44 B>C
10 C”

If I am understanding your notation correctly, A would win in

 this example. The full ranking would be:

A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2))
B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2))
C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2))

As you can see, when a candidate only appears as a first-place

 or last-place preference, their K-count is simply equal to the
 number of voters ranking them first.

Thanks all!

On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections)

 <elections@jenningsstory.com> wrote:

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the

 candidate with the smallest sum of SQUARES of non-victories
 (defeats plus ties) against their opponents.

Taking the square root and dividing can make it meaningful by

 scaling it to [0,1] or [0,s] (where s is the number of voters),
 but doesn't change the finish order.

It does seem like an interesting attempt to "square the

 circle" (great pun) and compromise between Borda and Condorcet. I
 hadn't realized that Borda and Minimax are minimizing the one-norm
 and infinity-norm in the same geometric space. The two-norm
 certainly seems like it should be explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via

 Election-Methods <election-methods@lists.electorama.com> wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me

 if this message violates any norms or protocols that the members
 of this list adhere to.

I have recently developed a novel method for tabulating

 ranked-choice elections that attempts to reconcile the concerns of
 Borda and Condorcet. I believe that it maintains the simplicity
 and mathematical elegance of the Borda count while incorporating
 Condorcet's concern with pairwise dominance. Intuitively, it can
 be understood as ordering candidates by how close they come to
 being unanimously selected when plotted in Cartesian coordinate
 space. Here is a link to the paper:
 https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing

Given its simplicity, I have been very surprised to discover

 that this method has never been proposed before. I am hoping that
 some of you all will take a look at the paper and share your
 comments, questions, and critiques. Ultimately, it is my hope that
 ranked-choice voting advocates can arrive at a consensus about the
 best method for RCV and thus strengthen efforts to adopt it and
 deliver much needed democratic improvements. But even if you don't
 find the system itself compelling, you may find the method of
 plotting electoral outcomes elucidated in the paper to be useful
 for the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - see https://electorama.com/em

 for list info
 ----
 Election-Methods mailing list - see https://electorama.com/em for
 list info

Election-Methods mailing list - seehttps://electorama.com/em for list info

Daniel, In common with the pro-Borda minded, you seem to be making the completely unjustified assumption that the multiple candidates are more or less equidistant from each other in "issue space" and so it's ok infer some maybe-sincere ratings from rankings. > Imagine an election with 26 candidates, A, B, C... Z, and 1 million > voters. Let us suppose that candidate A is unanimously preferred to > every other candidate, 1,000,000 to 0, except for candidate Z, to whom > she loses by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats > every other candidate by the same 2 vote margin, and is thus very > narrowly a Condorcet winner. Does it really reflect the will of the > majority better to declare candidate Z the winner because of his > extraordinarily narrow margin over all of the opposition when > candidate A is the unanimous favorite versus everyone but Candidate Z, > to whom she barely loses? Yes. The other (related) thing you seem to have in common with them is obliviousness to Clones.  Like Borda, I am sure your method fails Clone Independence (but maybe less egregiously). With only ranking information, other things being equal, I don't see any justification for rejecting Condorcet (or Smith).  Based on positional information we can sometimes guess that some other candidate is higher Social Utility, but probably not in a way that is reliable or isn't very vulnerable to strategy. For example say this is an election for a seat in the House of Representatives in Australia which uses compulsory full strict ranking Hare: 49 A>C>B 48 B>C>A 03 C>A>B The A and B supporters very likely only ranked C because they were forced to fully rank.  C is the voted Condorcet winner, but it would never cross anyone's mind in Australia that C should be the winner.  In some places C might have struggled to get on the ballot, and in Australia would be in danger of forfeiting his or her cash deposit (for not getting a high enough percentage of the "primary vote".) If truncation was allowed (as I think it should be) then most likely the A and B voters would have truncated and A would be the voted CW  (A>B 51-49,  A>C 49-3). But aside from that by far the main reason why a method that fails Condorcet might be acceptable is that the Condorcet criterion is incompatible with other criteria that people like.  Because Condorcet is incompatible with Later-no-Help all Condorcet methods are vulnerable (to varying degrees) to Burial strategy. It's a bit like comparing two engines, one performs perfectly with clean pure fuel but very badly with dirty impure fuel and another that doesn't do quite as well with clean fuel but copes quite a bit better with dirty fuel.  I'm thinking of course of the comparison between a Condorcet method and Hare. Chris On 19/05/2025 9:16 am, Daniel Kirslis via Election-Methods wrote: > Hi r b-j, > > Thank you for this response. I want to address both of your principles. > > First, is "one person, one vote". I of course agree completely that > each individual's vote should be treated exactly equally, and the > K-count does this. You say that "for any ranked ballot, this means > that if Candidate A is ranked higher than Candidate B then that is a > vote for A... It doesn't matter how many levels A is ranked higher > than B, it counts as exactly one vote for A." This is precisely how > the K-count works - if A is ranked above B on one ballot, then A > advances by one along the 'preferred to B' axis. The number of > rankings between them is immaterial to A's position vis a vis the B > axis. However, if A is ranked above other candidates on that ballot, A > will also advance along those candidates' axes, so it is perhaps not > exactly "one vote". But each voter's vote has the same potential power. > > To your second principle. You say "I cannot understand why, *if* a > Condorcet winner exists, how *any* other method; Hare, Borda, Bucklin, > or Kirslis is more democratic than Condorcet." Let me give an example > to illustrate, which relates to the principle of majority rule. > > Imagine an election with 26 candidates, A, B, C... Z, and 1 million > voters. Let us suppose that candidate A is unanimously preferred to > every other candidate, 1,000,000 to 0, except for candidate Z, to whom > she loses by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats > every other candidate by the same 2 vote margin, and is thus very > narrowly a Condorcet winner. Does it really reflect the will of the > majority better to declare candidate Z the winner because of his > extraordinarily narrow margin over all of the opposition when > candidate A is the unanimous favorite versus everyone but Candidate Z, > to whom she barely loses? Many more preferences are violated by > choosing the Condorcet winner in this case than choosing candidate A. > This is the heart of the issue with the Condorcet winner criteria - if > a Condorcet winner exists, a Condorcet method *must* completely ignore > the size of the margins of victory, no matter how large. In my view, > this curtails the meaning of 'majority rule' in a way that feels > undemocratic. > > I am not familiar with the Burlington election that you reference, and > I will look into it when I have a chance. I don't know what the > K-count would decide in that case. But I can try to answer in > principle your question "How *possibly* can Candidate B be elected > without counting those 3476 voters' individual votes a little more > (like 17% more) than how much the votes were counted from the 4064 > voters preferring Candidate A?" In the K-count, for Candidate B to be > elected in this scenario, there would need to be a 3rd candidate (or > multiple other candidates) to whom B was widely preferred but A was > not. So, B would win because the people who favored A still preferred > B to C, while the people who favored B preferred C to A. If you only > look at the head-to-head votes of A vs. B, this seems > anti-majoritarian, but the point I make in the paper is that you > cannot**make valid inferences by decontextualizing the data like that, > as doing so can lead you into the logical contradiction of a Condorcet > cycle. It is in the very nature of multi-option preference aggregation > that the data cannot be decomposed in this way. Another way of > thinking about this is - suppose that while A is preferred to B, B is > preferred to C, and C is preferred to A, so you have a classic > Condorcet cycle. Then, someone must be declared the winner, so in your > reasoning, someone's votes will be counted for more than someone > else's. And, when resolving this issue, most Condorcet methods will > look at the margins of victory, even though they are ignored in the > case when a Condorcet winner exists. But if margins matter enough to > decide a winner when no Condorcet winner exists, why is it okay to > completely ignore them when a Condorcet winner does exist? > > The K-count is a way of trying to reconcile Condorcet's conception of > majority rule, which looks for majority in terms of each head-to-head > matchup, with Borda's conception of majority rule, which seeks to > honor the maximum number of individual pairwise preferences. > > Thanks again for your response, and thank you for looking over the > paper. I appreciate your civil tone and good faith questions, and I > hope it is clear that the discussion here is made with full respect > and in a spirit of friendly intellectual inquiry. And I welcome your > response to these arguments! > > I am also considering the questions from other folks and am working on > responses to those as well. > > On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via > Election-Methods <election-methods@lists.electorama.com> wrote: > > > Hi Dan, > > I made one pass through your paper, but the interaction with Chris > and Andy was helpful.  I understand the definition of your K-count > measure, but still don't understand the motivation of it, solely > from the POV of democratic principles, which is where I draw my > Condorcetist perspective.  Admittedly, I am a hard-core Condorcet > advocate, but I am so because of some basic principles. > > I read your section 9 and re-read it, and I still cannot get past > how it justifies *any* non-Condorcet method (including your > K-count) over Condorcet.  The principles of free and fair > elections in a democratic context require, among other things, > that our votes are valued equally: > >     1. "One person, one vote": Every enfranchised voter has an > equal influence on >     government in elections because of our inherent equality as > citizens and this is >     independent of any utilitarian notion of personal investment > in the outcome. If I >     enthusiastically prefer Candidate A and you prefer Candidate B > only tepidly, your >     vote for Candidate B counts no less (nor more) than my vote > for A. The >     effectiveness of one's vote – how much their vote counts – is > not proportional to >     their degree of preference but is determined only by their > franchise. A citizen with >     franchise has a vote that counts equally as much as any other > citizen with >     franchise. For any ranked ballot, this means that if Candidate > A is ranked higher >     than Candidate B then that is a vote for A, if only candidates > A and B are >     contending (such as in the IRV final round). It doesn't matter > how many levels A >     is ranked higher than B, it counts as exactly one vote for A. > > If our votes are not valued equally, then I want my vote to count > more than yours.  If that is unacceptable (understandably) then we > must agree to count our votes equally.  In the U.S., too many > people have died over that inequality.  So then, in order for our > votes to be valued equally, we must have Majority Rule in > single-winner elections: > >     2. Majority rule: If more voters mark their ballots preferring > Candidate A over >     Candidate B than the number of voters marking their ballots to > the contrary, >     then Candidate B is not elected. If Candidate B were to be > elected, that would >     mean that the fewer voters preferring Candidate B had cast > votes that had greater >     value and counted more than those votes from voters of the > larger set preferring >     Candidate A. > > Those are two ways of, essentially, expressing the same principle > in single-winner elections.  For multi-winner elections, the way > to value our votes equally would be Proportional Representation, > but I don't wanna go there in this discussion.  I would like to > stay with single-winner elections. > > Now, of course this doesn't deal with the problem of cycles and we > can discuss what the best and most democratic way to deal with > cycles is, but I cannot understand why, *if* a Condorcet winner > exists, how *any* other method; Hare, Borda, Bucklin, or Kirslis > is more democratic than Condorcet. > > If a CW exists and we *know* (from the Cast Vote Record having > ranked ballot data) that the CW exists and who that CW is, how is > electing the K-count winner, assuming they're different from the > CW, more democratic?  Just like with the IRV failures, we will > *know* that a smaller set of voters have left that election > satisfied than that of a larger set of voters leaving the election > dissatisfied.  We will know that the votes coming from that > smaller set of voters were more effective in electing their > preferred candidate than the votes coming from the larger set of > voters that not only preferred someone else, but they preferred a > *specific* candidate over the one who Kirslis elected and marked > their ballots saying so.  For the very same reason that IRV failed > in Burlington Vermont in 2009 or in Alaska in August 2022, the > elected candidate will suffer a sense of loss of legitimacy in the > election. > > In Burlington in 2009, 4064 voters marked their ballots that > Candidate A was a better choice than Candidate B and 3476 voters > marked their ballots to the contrary.  (There were 1436 voters > that didn't like either A or B and didn't rank either.)  How > *possibly* can Candidate B be elected without counting those 3476 > voters' individual votes a little more (like 17% more) than how > much the votes were counted from the 4064 voters preferring > Candidate A? > > Now this is a failure of Hare (IRV) but I can construct the very > same question for an election decided with Kirslis rules that > failed to elect the CW when such exists.  How would you answer > that question?  How do you justify satisfying a smaller set of > voters at the expense of a larger set of voters that preferred, > not just anyone else, but a specific candidate over the Kirslis > winner?  I couldn't glean an answer to that from section 9 (or > anywhere else) in your paper. > > bestest, > > -- > > r b-j . _ . _ . _ . _ rbj@audioimagination.com > > "Imagination is more important than knowledge." > > . > . > . > > > On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods > <election-methods@lists.electorama.com> wrote: > > > > > > Hi all, > > > > Thanks so much for the replies. I’ll respond to everyone in this > thread. > > > > Andy - I really appreciate your feedback. Your summary is > correct, and your framing of it as one-norm vs. two-norm vs. > infinity-norm is a way of thinking about it that I had not > considered. It seems like a potentially fruitful lens for > understanding it. And, as perhaps you have surmised, I may have > been mistaken in the statement about the sincere favorite > criteria, but I am working on an analysis of the issue that I will > share. > > > > Toby, making a short summary is a great suggestion. The argument > in the paper is admittedly a bit convoluted before it presents the > actual method. Here is the simplified way that I would explain it: > > > > Each voter ranks their preferences, with ties allowed and > unranked candidates treated as last-place preferences. Then, for > each candidate, you make a plot, where each axis is the total > number of times that they were preferred to each of their > opponents. So, if the candidates are A, B, and C, candidate A’s > plot would have “number of times preferred to B” on one axis and > “number of times preferred to C” on the other axis. Candidate B & > C could be plotted similarly in terms of their opponents. The > winner is simply the candidate who is plotted the farthest up and > to the right, or closest to topmost and rightmost point, which is > where a candidate who is the unanimous first-place choice would be > plotted. The distance from that point is calculated using the > Pythagorean theorem, which is where minimizing the sum of squares > that Andy referenced comes in. > > > > The figures in the paper tell the story better than the words, > as it is essentially a geometric idea. And, sections 4, 5, and 6 > can really be skipped - they are more about justifying the > approach than explaining it. > > > > Chris, you asked “Why should we be interested in the "concerns" > of Borda (whatever they are)? And so much that we should embrace a > method that fails the Condorcet criterion?” Great question. If you > look at the Stanford Encyclopedia of Philosophy’s entry on Social > Choice Theory, they list Condorcet and Borda as the original > pioneers of this thinking > (https://plato.stanford.edu/entries/social-choice/). Borda thinks > about majoritarianism in terms of votes, while Condorcet thinks > about it in terms of voters. Obviously, in FPP elections, these > are the same, but the heart of the interest in these questions > comes from the tension that arises between them in a ranked-choice > setting, where each voter has multiple votes and ‘majoritarianism’ > is no longer simple to define. Don Saari is a thinker who studies > these issues and has argued most persuasively for Borda’s approach > over Condorcet methods. In section 9 of my paper, I explain some > of my philosophical objections to the Condorcet winner criterion. > > > > You also asked “Do you propose allowing above-bottom equal > ranking or truncation?” Equal ranking is allowed, and unranked > candidates are treated as last place. > > > > And, I am afraid I may have actually been mistaken about the > sincere favorite property, so will have to disappoint you there. > > > > You asked “Who does your method elect in this example? > > > > 46 A > > 44 B>C > > 10 C” > > > > If I am understanding your notation correctly, A would win in > this example. The full ranking would be: > > A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2)) > > B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2)) > > C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2)) > > > > As you can see, when a candidate only appears as a first-place > or last-place preference, their K-count is simply equal to the > number of voters ranking them first. > > > > Thanks all! > > > > > > On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) > <elections@jenningsstory.com> wrote: > > > Hi Dan, > > > > > > Great paper. Thank you for posting! > > > > > > It seems like the short version is that the winner is the > candidate with the smallest sum of SQUARES of non-victories > (defeats plus ties) against their opponents. > > > > > > Taking the square root and dividing can make it meaningful by > scaling it to [0,1] or [0,s] (where s is the number of voters), > but doesn't change the finish order. > > > > > > > > > It does seem like an interesting attempt to "square the > circle" (great pun) and compromise between Borda and Condorcet. I > hadn't realized that Borda and Minimax are minimizing the one-norm > and infinity-norm in the same geometric space. The two-norm > certainly seems like it should be explored. > > > > > > I would love to see the proof of non-favorite-betrayal. > > > > > > Best, > > > > > > ~ Andy > > > On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via > Election-Methods <election-methods@lists.electorama.com> wrote: > > > > > > > Hello! > > > > > > > > I am a newcomer to this mailing list, so please forgive me > if this message violates any norms or protocols that the members > of this list adhere to. > > > > > > > > I have recently developed a novel method for tabulating > ranked-choice elections that attempts to reconcile the concerns of > Borda and Condorcet. I believe that it maintains the simplicity > and mathematical elegance of the Borda count while incorporating > Condorcet's concern with pairwise dominance. Intuitively, it can > be understood as ordering candidates by how close they come to > being unanimously selected when plotted in Cartesian coordinate > space. Here is a link to the paper: > > > > > https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing > > > > > > > > Given its simplicity, I have been very surprised to discover > that this method has never been proposed before. I am hoping that > some of you all will take a look at the paper and share your > comments, questions, and critiques. Ultimately, it is my hope that > ranked-choice voting advocates can arrive at a consensus about the > best method for RCV and thus strengthen efforts to adopt it and > deliver much needed democratic improvements. But even if you don't > find the system itself compelling, you may find the method of > plotting electoral outcomes elucidated in the paper to be useful > for the analysis of other electoral systems. > > > > > > > > Thank you! > > > > > > > > -Dan > > > > > > > > ---- > > Election-Methods mailing list - see https://electorama.com/em > for list info > ---- > Election-Methods mailing list - see https://electorama.com/em for > list info > > > ---- > Election-Methods mailing list - seehttps://electorama.com/em for list info
KM
Kristofer Munsterhjelm
Mon, May 19, 2025 7:39 PM

On 2025-05-16 01:24, Daniel Kirslis via Election-Methods wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this
message violates any norms or protocols that the members of this list
adhere to.

Welcome :-)

Given its simplicity, I have been very surprised to discover that this
method has never been proposed before. I am hoping that some of you all
will take a look at the paper and share your comments, questions, and
critiques.

I would have to look more in detail to see if this has been asked in the
paper already, but the obvious things to ask about for Borda and
Borda-hybrids are whether they pass majority and what kind of clone
incentives exist, if any. Borda sometimes fails majority and it does
have a pretty serious teaming incentive. Do you know anything about its
performance on either criterion?

In another post, you mentioned that Condorcet can produce some, in your
opinion, unreasonable edge cases. Do you think the same holds for the
majority criterion? E.g.

5001: A>B>C
4999: B>C>A

A Borda proponent could argue that A is too divisive by being ranked
last by the minority, but B is not ranked last by anyone and so should
be elected instead.

Ultimately, it is my hope that ranked-choice voting advocates
can arrive at a consensus about the best method for RCV and thus
strengthen efforts to adopt it and deliver much needed democratic
improvements. But even if you don't find the system itself compelling,
you may find the method of plotting electoral outcomes elucidated in the
paper to be useful for the analysis of other electoral systems.

I'm a Condorcetist, so I may be biased, but the last poll we did listed
the EM participants' favorite methods to be ranked pairs and Benham's
method. The former if strategic voting is not a problem, the latter if
it is.

Then there are some people who prefer IRV, and a third group that
prefers cardinal methods. The problem, though, isn't as much division
among EM members as it is division outside EM. (Good luck getting
FairVote to change their position from IRV!)

Perhaps I underestimate the potential of compromise methods. But the
different groups outside EM seem to be quite set in their preferences.
The us-or-them dynamics of FPTP is unfortunately too prevalent.

-km

On 2025-05-16 01:24, Daniel Kirslis via Election-Methods wrote: > Hello! > > I am a newcomer to this mailing list, so please forgive me if this > message violates any norms or protocols that the members of this list > adhere to. Welcome :-) > Given its simplicity, I have been very surprised to discover that this > method has never been proposed before. I am hoping that some of you all > will take a look at the paper and share your comments, questions, and > critiques. I would have to look more in detail to see if this has been asked in the paper already, but the obvious things to ask about for Borda and Borda-hybrids are whether they pass majority and what kind of clone incentives exist, if any. Borda sometimes fails majority and it does have a pretty serious teaming incentive. Do you know anything about its performance on either criterion? In another post, you mentioned that Condorcet can produce some, in your opinion, unreasonable edge cases. Do you think the same holds for the majority criterion? E.g. 5001: A>B>C 4999: B>C>A A Borda proponent could argue that A is too divisive by being ranked last by the minority, but B is not ranked last by anyone and so should be elected instead. > Ultimately, it is my hope that ranked-choice voting advocates > can arrive at a consensus about the best method for RCV and thus > strengthen efforts to adopt it and deliver much needed democratic > improvements. But even if you don't find the system itself compelling, > you may find the method of plotting electoral outcomes elucidated in the > paper to be useful for the analysis of other electoral systems. I'm a Condorcetist, so I may be biased, but the last poll we did listed the EM participants' favorite methods to be ranked pairs and Benham's method. The former if strategic voting is not a problem, the latter if it is. Then there are some people who prefer IRV, and a third group that prefers cardinal methods. The problem, though, isn't as much division among EM members as it is division outside EM. (Good luck getting FairVote to change their position from IRV!) Perhaps I underestimate the potential of compromise methods. But the different groups outside EM seem to be quite set in their preferences. The us-or-them dynamics of FPTP is unfortunately too prevalent. -km
DK
Daniel Kirslis
Mon, May 19, 2025 11:28 PM

Hi Chris,

Yes, that is correct. I have created a simplified version of the paper that
attempts to explain the method in the most concise possible way. It's only
two pages:
https://drive.google.com/file/d/1F_I2ZBUKXKbmcS-uSvMAf_gNdNO8m0GB/view?usp=drive_link

It skips over a lot of the background that explains why I view this as a
compromise between the Borda count and Condorcet methods and just focuses
on explaining the method itself. Once you see how the plotting works, it is
like Bocce Ball - closest to the target ball wins.

Thank you for your engagement on this. I should have started with this
version of the paper!

On Mon, May 19, 2025 at 12:32 PM Chris Benham via Election-Methods <
election-methods@lists.electorama.com> wrote:

It seems like the short version is that the winner is the candidate with
the smallest sum of SQUARES of non-victories (defeats plus ties) against
their opponents.

I take that these numbers you are squaring are the candidate's opposing
and tying vote scores, and not simply the number of such results. Is that
right?

Because otherwise that would often be very indecisive, like Copeland.

On 19/05/2025 1:40 am, Andrew B Jennings (elections) via Election-Methods
wrote:

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the candidate with
the smallest sum of SQUARES of non-victories (defeats plus ties) against
their opponents.

Taking the square root and dividing can make it meaningful by scaling it
to [0,1] or [0,s] (where s is the number of voters), but doesn't change the
finish order.

It does seem like an interesting attempt to "square the circle" (great
pun) and compromise between Borda and Condorcet. I hadn't realized that
Borda and Minimax are minimizing the one-norm and infinity-norm in the same
geometric space. The two-norm certainly seems like it should be explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via
Election-Methods election-methods@lists.electorama.com
election-methods@lists.electorama.com wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this message
violates any norms or protocols that the members of this list adhere to.

I have recently developed a novel method for tabulating ranked-choice
elections that attempts to reconcile the concerns of Borda and Condorcet. I
believe that it maintains the simplicity and mathematical elegance of the
Borda count while incorporating Condorcet's concern with pairwise
dominance. Intuitively, it can be understood as ordering candidates by how
close they come to being unanimously selected when plotted in Cartesian
coordinate space. Here is a link to the paper:

https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing

Given its simplicity, I have been very surprised to discover that this
method has never been proposed before. I am hoping that some of you all
will take a look at the paper and share your comments, questions, and
critiques. Ultimately, it is my hope that ranked-choice voting advocates
can arrive at a consensus about the best method for RCV and thus strengthen
efforts to adopt it and deliver much needed democratic improvements. But
even if you don't find the system itself compelling, you may find the
method of plotting electoral outcomes elucidated in the paper to be useful
for the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - see https://electorama.com/em for list info


Election-Methods mailing list - see https://electorama.com/em for list
info

Hi Chris, Yes, that is correct. I have created a simplified version of the paper that attempts to explain the method in the most concise possible way. It's only two pages: https://drive.google.com/file/d/1F_I2ZBUKXKbmcS-uSvMAf_gNdNO8m0GB/view?usp=drive_link It skips over a lot of the background that explains why I view this as a compromise between the Borda count and Condorcet methods and just focuses on explaining the method itself. Once you see how the plotting works, it is like Bocce Ball - closest to the target ball wins. Thank you for your engagement on this. I should have started with this version of the paper! On Mon, May 19, 2025 at 12:32 PM Chris Benham via Election-Methods < election-methods@lists.electorama.com> wrote: > > It seems like the short version is that the winner is the candidate with > the smallest sum of SQUARES of non-victories (defeats plus ties) against > their opponents. > > > I take that these numbers you are squaring are the candidate's opposing > and tying vote scores, and not simply the number of such results. Is that > right? > > Because otherwise that would often be very indecisive, like Copeland. > > > On 19/05/2025 1:40 am, Andrew B Jennings (elections) via Election-Methods > wrote: > > Hi Dan, > > Great paper. Thank you for posting! > > It seems like the short version is that the winner is the candidate with > the smallest sum of SQUARES of non-victories (defeats plus ties) against > their opponents. > > Taking the square root and dividing can make it meaningful by scaling it > to [0,1] or [0,s] (where s is the number of voters), but doesn't change the > finish order. > > It does seem like an interesting attempt to "square the circle" (great > pun) and compromise between Borda and Condorcet. I hadn't realized that > Borda and Minimax are minimizing the one-norm and infinity-norm in the same > geometric space. The two-norm certainly seems like it should be explored. > > I would love to see the proof of non-favorite-betrayal. > > Best, > > ~ Andy > On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via > Election-Methods <election-methods@lists.electorama.com> > <election-methods@lists.electorama.com> wrote: > > Hello! > > I am a newcomer to this mailing list, so please forgive me if this message > violates any norms or protocols that the members of this list adhere to. > > I have recently developed a novel method for tabulating ranked-choice > elections that attempts to reconcile the concerns of Borda and Condorcet. I > believe that it maintains the simplicity and mathematical elegance of the > Borda count while incorporating Condorcet's concern with pairwise > dominance. Intuitively, it can be understood as ordering candidates by how > close they come to being unanimously selected when plotted in Cartesian > coordinate space. Here is a link to the paper: > > https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing > > Given its simplicity, I have been very surprised to discover that this > method has never been proposed before. I am hoping that some of you all > will take a look at the paper and share your comments, questions, and > critiques. Ultimately, it is my hope that ranked-choice voting advocates > can arrive at a consensus about the best method for RCV and thus strengthen > efforts to adopt it and deliver much needed democratic improvements. But > even if you don't find the system itself compelling, you may find the > method of plotting electoral outcomes elucidated in the paper to be useful > for the analysis of other electoral systems. > > Thank you! > > -Dan > > > > ---- > Election-Methods mailing list - see https://electorama.com/em for list info > > ---- > Election-Methods mailing list - see https://electorama.com/em for list > info >
DK
Daniel Kirslis
Tue, May 20, 2025 12:35 AM

Hi Chris,

I actually do not believe that the Borda count infers ratings from
rankings. I understand how it appears that way, as higher ranked candidates
get more points than lower ranked candidates, so it seems like there is
something cardinal going on. But the Borda count is simply awarding one
point to a candidate each time they are preferred to any other candidate.

In an election with n candidates, there will be n(n-1)/2 unique pairings of
candidates. Each voter will therefore have n(n-1)/2 pairwise preferences.
The Borda count can be understood as selecting the candidate who will honor
the maximum number of those preferences (or equivalently, violate the
minimum number of those preferences). Obviously, there are many ways of
defining a social welfare function, but I believe that the Borda count
optimizes for this simplest and most intuitive definition.

In my example with the 26 candidates, selecting the Condorcet winner,
candidate Z, violates 499,999*1,000,000 pairwise preferences. Meanwhile,
selecting candidate A violates only 500,001 preferences. This is why I find
going with candidate Z so objectionable.

As you note, this is ignoring strategic voting and slate manipulation. I am
working on a proof showing that the K-count is less vulnerable to burying
and cloning than the Borda count, but it is certainly not invulnerable.

In your example election, the K-count would choose C (51.5) > A (50.47) > B
(48). Perhaps this is my American bias, where political polarization seems
to push us ever closer to civil war, but I would like to see C win in this
scenario, as they are the least objectionable candidate. In my view, it is
better to have a weak leader who is tepidly endorsed than a leader who is
passionately hated by nearly half the population. Obviously a very
subjective issue.

I like your metaphor with the engines and fuels. I think of it as two
paradigms: preference aggregation, where we can assume that individuals
give honest preferences and the slate is not manipulated, vs. electoral
methods, where we must assume voters and parties are strategic. I
originally conceived the K-count as a preference aggregation function, but
of course the two paradigms are closely related.

-Dan

On Mon, May 19, 2025 at 1:59 PM Chris Benham via Election-Methods <
election-methods@lists.electorama.com> wrote:

Daniel,

In common with the pro-Borda minded, you seem to be making the completely
unjustified assumption that the multiple candidates are more or less
equidistant from each other in "issue space" and so it's ok infer some
maybe-sincere ratings from rankings.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million
voters. Let us suppose that candidate A is unanimously preferred to every
other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses
by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other
candidate by the same 2 vote margin, and is thus very narrowly a Condorcet
winner. Does it really reflect the will of the majority better to declare
candidate Z the winner because of his extraordinarily narrow margin over
all of the opposition when candidate A is the unanimous favorite versus
everyone but Candidate Z, to whom she barely loses?

Yes. The other (related) thing you seem to have in common with them is
obliviousness to Clones.  Like Borda, I am sure your method fails Clone
Independence (but maybe less egregiously).

With only ranking information, other things being equal, I don't see any
justification for rejecting Condorcet (or Smith).  Based on positional
information we can sometimes guess that some other candidate is higher
Social Utility, but probably not in a way that is reliable or isn't very
vulnerable to strategy.

For example say this is an election for a seat in the House of
Representatives in Australia which uses compulsory full strict ranking Hare:

49 A>C>B
48 B>C>A
03 C>A>B

The A and B supporters very likely only ranked C because they were forced
to fully rank.  C is the voted Condorcet winner, but it would never cross
anyone's mind in Australia that C should be the winner.  In some places C
might have struggled to get on the ballot, and in Australia would be in
danger of forfeiting his or her cash deposit (for not getting a high enough
percentage of the "primary vote".)

If truncation was allowed (as I think it should be) then most likely the A
and B voters would have truncated and A would be the voted CW  (A>B 51-49,
A>C 49-3).

But aside from that by far the main reason why a method that fails
Condorcet might be acceptable is that the Condorcet criterion is
incompatible with other criteria that people like.  Because Condorcet is
incompatible with Later-no-Help all Condorcet methods are vulnerable (to
varying degrees) to Burial strategy.

It's a bit like comparing two engines, one performs perfectly with clean
pure fuel but very badly with dirty impure fuel and another that doesn't do
quite as well with clean fuel but copes quite a bit better with dirty
fuel.  I'm thinking of course of the comparison between a Condorcet method
and Hare.

Chris

On 19/05/2025 9:16 am, Daniel Kirslis via Election-Methods wrote:

Hi r b-j,

Thank you for this response. I want to address both of your principles.

First, is "one person, one vote". I of course agree completely that each
individual's vote should be treated exactly equally, and the K-count does
this. You say that "for any ranked ballot, this means that if Candidate A
is ranked higher than Candidate B then that is a vote for A... It doesn't
matter how many levels A is ranked higher than B, it counts as exactly one
vote for A." This is precisely how the K-count works - if A is ranked above
B on one ballot, then A advances by one along the 'preferred to B' axis.
The number of rankings between them is immaterial to A's position vis a vis
the B axis. However, if A is ranked above other candidates on that ballot,
A will also advance along those candidates' axes, so it is perhaps not
exactly "one vote". But each voter's vote has the same potential power.

To your second principle. You say "I cannot understand why, if a
Condorcet winner exists, how any other method; Hare, Borda, Bucklin, or
Kirslis is more democratic than Condorcet." Let me give an example to
illustrate, which relates to the principle of majority rule.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million
voters. Let us suppose that candidate A is unanimously preferred to every
other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses
by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other
candidate by the same 2 vote margin, and is thus very narrowly a Condorcet
winner. Does it really reflect the will of the majority better to declare
candidate Z the winner because of his extraordinarily narrow margin over
all of the opposition when candidate A is the unanimous favorite versus
everyone but Candidate Z, to whom she barely loses? Many more preferences
are violated by choosing the Condorcet winner in this case than
choosing candidate A. This is the heart of the issue with the Condorcet
winner criteria - if a Condorcet winner exists, a Condorcet method must completely
ignore the size of the margins of victory, no matter how large. In my view,
this curtails the meaning of 'majority rule' in a way that feels
undemocratic.

I am not familiar with the Burlington election that you reference, and I
will look into it when I have a chance. I don't know what the K-count would
decide in that case. But I can try to answer in principle your question
"How possibly can Candidate B be elected without counting those 3476
voters' individual votes a little more (like 17% more) than how much the
votes were counted from the 4064 voters preferring Candidate A?" In the
K-count, for Candidate B to be elected in this scenario, there would need
to be a 3rd candidate (or multiple other candidates) to whom B was widely
preferred but A was not. So, B would win because the people who favored A
still preferred B to C, while the people who favored B preferred C to A. If
you only look at the head-to-head votes of A vs. B, this seems
anti-majoritarian, but the point I make in the paper is that you cannot make
valid inferences by decontextualizing the data like that, as doing so can
lead you into the logical contradiction of a Condorcet cycle. It is in the
very nature of multi-option preference aggregation that the data cannot be
decomposed in this way. Another way of thinking about this is - suppose
that while A is preferred to B, B is preferred to C, and C is preferred to
A, so you have a classic Condorcet cycle. Then, someone must be declared
the winner, so in your reasoning, someone's votes will be counted for more
than someone else's. And, when resolving this issue, most Condorcet methods
will look at the margins of victory, even though they are ignored in the
case when a Condorcet winner exists. But if margins matter enough to decide
a winner when no Condorcet winner exists, why is it okay to completely
ignore them when a Condorcet winner does exist?

The K-count is a way of trying to reconcile Condorcet's conception of
majority rule, which looks for majority in terms of each head-to-head
matchup, with Borda's conception of majority rule, which seeks to honor the
maximum number of individual pairwise preferences.

Thanks again for your response, and thank you for looking over the paper.
I appreciate your civil tone and good faith questions, and I hope it is
clear that the discussion here is made with full respect and in a spirit of
friendly intellectual inquiry. And I welcome your response to these
arguments!

I am also considering the questions from other folks and am working on
responses to those as well.

On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via
Election-Methods election-methods@lists.electorama.com wrote:

Hi Dan,

I made one pass through your paper, but the interaction with Chris and
Andy was helpful.  I understand the definition of your K-count measure, but
still don't understand the motivation of it, solely from the POV of
democratic principles, which is where I draw my Condorcetist perspective.
Admittedly, I am a hard-core Condorcet advocate, but I am so because of
some basic principles.

I read your section 9 and re-read it, and I still cannot get past how it
justifies any non-Condorcet method (including your K-count) over
Condorcet.  The principles of free and fair elections in a democratic
context require, among other things, that our votes are valued equally:

 1. "One person, one vote": Every enfranchised voter has an equal

influence on
government in elections because of our inherent equality as citizens
and this is
independent of any utilitarian notion of personal investment in the
outcome. If I
enthusiastically prefer Candidate A and you prefer Candidate B only
tepidly, your
vote for Candidate B counts no less (nor more) than my vote for A. The
effectiveness of one's vote – how much their vote counts – is not
proportional to
their degree of preference but is determined only by their franchise.
A citizen with
franchise has a vote that counts equally as much as any other citizen
with
franchise. For any ranked ballot, this means that if Candidate A is
ranked higher
than Candidate B then that is a vote for A, if only candidates A and
B are
contending (such as in the IRV final round). It doesn't matter how
many levels A
is ranked higher than B, it counts as exactly one vote for A.

If our votes are not valued equally, then I want my vote to count more
than yours.  If that is unacceptable (understandably) then we must agree to
count our votes equally.  In the U.S., too many people have died over that
inequality.  So then, in order for our votes to be valued equally, we must
have Majority Rule in single-winner elections:

 2. Majority rule: If more voters mark their ballots preferring

Candidate A over
Candidate B than the number of voters marking their ballots to the
contrary,
then Candidate B is not elected. If Candidate B were to be elected,
that would
mean that the fewer voters preferring Candidate B had cast votes that
had greater
value and counted more than those votes from voters of the larger set
preferring
Candidate A.

Those are two ways of, essentially, expressing the same principle in
single-winner elections.  For multi-winner elections, the way to value our
votes equally would be Proportional Representation, but I don't wanna go
there in this discussion.  I would like to stay with single-winner
elections.

Now, of course this doesn't deal with the problem of cycles and we can
discuss what the best and most democratic way to deal with cycles is, but I
cannot understand why, if a Condorcet winner exists, how any other
method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet.

If a CW exists and we know (from the Cast Vote Record having ranked
ballot data) that the CW exists and who that CW is, how is electing the
K-count winner, assuming they're different from the CW, more democratic?
Just like with the IRV failures, we will know that a smaller set of
voters have left that election satisfied than that of a larger set of
voters leaving the election dissatisfied.  We will know that the votes
coming from that smaller set of voters were more effective in electing
their preferred candidate than the votes coming from the larger set of
voters that not only preferred someone else, but they preferred a
specific candidate over the one who Kirslis elected and marked their
ballots saying so.  For the very same reason that IRV failed in Burlington
Vermont in 2009 or in Alaska in August 2022, the elected candidate will
suffer a sense of loss of legitimacy in the election.

In Burlington in 2009, 4064 voters marked their ballots that Candidate A
was a better choice than Candidate B and 3476 voters marked their ballots
to the contrary.  (There were 1436 voters that didn't like either A or B
and didn't rank either.)  How possibly can Candidate B be elected without
counting those 3476 voters' individual votes a little more (like 17% more)
than how much the votes were counted from the 4064 voters preferring
Candidate A?

Now this is a failure of Hare (IRV) but I can construct the very same
question for an election decided with Kirslis rules that failed to elect
the CW when such exists.  How would you answer that question?  How do you
justify satisfying a smaller set of voters at the expense of a larger set
of voters that preferred, not just anyone else, but a specific candidate
over the Kirslis winner?  I couldn't glean an answer to that from section 9
(or anywhere else) in your paper.

bestest,

--

r b-j . _ . _ . _ . _ rbj@audioimagination.com

"Imagination is more important than knowledge."

.
.
.

On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods <

Hi all,

Thanks so much for the replies. I’ll respond to everyone in this thread.

Andy - I really appreciate your feedback. Your summary is correct, and

your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of
thinking about it that I had not considered. It seems like a potentially
fruitful lens for understanding it. And, as perhaps you have surmised, I
may have been mistaken in the statement about the sincere favorite
criteria, but I am working on an analysis of the issue that I will share.

Toby, making a short summary is a great suggestion. The argument in the

paper is admittedly a bit convoluted before it presents the actual method.
Here is the simplified way that I would explain it:

Each voter ranks their preferences, with ties allowed and unranked

candidates treated as last-place preferences. Then, for each candidate, you
make a plot, where each axis is the total number of times that they were
preferred to each of their opponents. So, if the candidates are A, B, and
C, candidate A’s plot would have “number of times preferred to B” on one
axis and “number of times preferred to C” on the other axis. Candidate B &
C could be plotted similarly in terms of their opponents. The winner is
simply the candidate who is plotted the farthest up and to the right, or
closest to topmost and rightmost point, which is where a candidate who is
the unanimous first-place choice would be plotted. The distance from that
point is calculated using the Pythagorean theorem, which is where
minimizing the sum of squares that Andy referenced comes in.

The figures in the paper tell the story better than the words, as it is

essentially a geometric idea. And, sections 4, 5, and 6 can really be
skipped - they are more about justifying the approach than explaining it.

Chris, you asked “Why should we be interested in the "concerns" of

Borda (whatever they are)? And so much that we should embrace a method that
fails the Condorcet criterion?” Great question. If you look at the Stanford
Encyclopedia of Philosophy’s entry on Social Choice Theory, they list
Condorcet and Borda as the original pioneers of this thinking (
https://plato.stanford.edu/entries/social-choice/). Borda thinks about
majoritarianism in terms of votes, while Condorcet thinks about it in terms
of voters. Obviously, in FPP elections, these are the same, but the heart
of the interest in these questions comes from the tension that arises
between them in a ranked-choice setting, where each voter has multiple
votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a
thinker who studies these issues and has argued most persuasively for
Borda’s approach over Condorcet methods. In section 9 of my paper, I
explain some of my philosophical objections to the Condorcet winner
criterion.

You also asked “Do you propose allowing above-bottom equal ranking or

truncation?” Equal ranking is allowed, and unranked candidates are treated
as last place.

And, I am afraid I may have actually been mistaken about the sincere

favorite property, so will have to disappoint you there.

You asked “Who does your method elect in this example?

46 A
44 B>C
10 C”

If I am understanding your notation correctly, A would win in this

example. The full ranking would be:

A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2))
B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2))
C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2))

As you can see, when a candidate only appears as a first-place or

last-place preference, their K-count is simply equal to the number of
voters ranking them first.

Thanks all!

On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) <

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the candidate

with the smallest sum of SQUARES of non-victories (defeats plus ties)
against their opponents.

Taking the square root and dividing can make it meaningful by scaling

it to [0,1] or [0,s] (where s is the number of voters), but doesn't change
the finish order.

It does seem like an interesting attempt to "square the circle"

(great pun) and compromise between Borda and Condorcet. I hadn't realized
that Borda and Minimax are minimizing the one-norm and infinity-norm in the
same geometric space. The two-norm certainly seems like it should be
explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via

Election-Methods election-methods@lists.electorama.com wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this

message violates any norms or protocols that the members of this list
adhere to.

I have recently developed a novel method for tabulating

ranked-choice elections that attempts to reconcile the concerns of Borda
and Condorcet. I believe that it maintains the simplicity and mathematical
elegance of the Borda count while incorporating Condorcet's concern with
pairwise dominance. Intuitively, it can be understood as ordering
candidates by how close they come to being unanimously selected when
plotted in Cartesian coordinate space. Here is a link to the paper:

Given its simplicity, I have been very surprised to discover that

this method has never been proposed before. I am hoping that some of you
all will take a look at the paper and share your comments, questions, and
critiques. Ultimately, it is my hope that ranked-choice voting advocates
can arrive at a consensus about the best method for RCV and thus strengthen
efforts to adopt it and deliver much needed democratic improvements. But
even if you don't find the system itself compelling, you may find the
method of plotting electoral outcomes elucidated in the paper to be useful
for the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - see https://electorama.com/em for list

info

Election-Methods mailing list - see https://electorama.com/em for list
info


Election-Methods mailing list - see https://electorama.com/em for list info


Election-Methods mailing list - see https://electorama.com/em for list
info

Hi Chris, I actually do not believe that the Borda count infers ratings from rankings. I understand how it appears that way, as higher ranked candidates get more points than lower ranked candidates, so it seems like there is something cardinal going on. But the Borda count is simply awarding one point to a candidate each time they are preferred to any other candidate. In an election with n candidates, there will be n(n-1)/2 unique pairings of candidates. Each voter will therefore have n(n-1)/2 pairwise preferences. The Borda count can be understood as selecting the candidate who will honor the maximum number of those preferences (or equivalently, violate the minimum number of those preferences). Obviously, there are many ways of defining a social welfare function, but I believe that the Borda count optimizes for this simplest and most intuitive definition. In my example with the 26 candidates, selecting the Condorcet winner, candidate Z, violates 499,999*1,000,000 pairwise preferences. Meanwhile, selecting candidate A violates only 500,001 preferences. This is why I find going with candidate Z so objectionable. As you note, this is ignoring strategic voting and slate manipulation. I am working on a proof showing that the K-count is less vulnerable to burying and cloning than the Borda count, but it is certainly not invulnerable. In your example election, the K-count would choose C (51.5) > A (50.47) > B (48). Perhaps this is my American bias, where political polarization seems to push us ever closer to civil war, but I would like to see C win in this scenario, as they are the least objectionable candidate. In my view, it is better to have a weak leader who is tepidly endorsed than a leader who is passionately hated by nearly half the population. Obviously a very subjective issue. I like your metaphor with the engines and fuels. I think of it as two paradigms: preference aggregation, where we can assume that individuals give honest preferences and the slate is not manipulated, vs. electoral methods, where we must assume voters and parties are strategic. I originally conceived the K-count as a preference aggregation function, but of course the two paradigms are closely related. -Dan On Mon, May 19, 2025 at 1:59 PM Chris Benham via Election-Methods < election-methods@lists.electorama.com> wrote: > Daniel, > > In common with the pro-Borda minded, you seem to be making the completely > unjustified assumption that the multiple candidates are more or less > equidistant from each other in "issue space" and so it's ok infer some > maybe-sincere ratings from rankings. > > Imagine an election with 26 candidates, A, B, C... Z, and 1 million > voters. Let us suppose that candidate A is unanimously preferred to every > other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses > by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other > candidate by the same 2 vote margin, and is thus very narrowly a Condorcet > winner. Does it really reflect the will of the majority better to declare > candidate Z the winner because of his extraordinarily narrow margin over > all of the opposition when candidate A is the unanimous favorite versus > everyone but Candidate Z, to whom she barely loses? > > > Yes. The other (related) thing you seem to have in common with them is > obliviousness to Clones. Like Borda, I am sure your method fails Clone > Independence (but maybe less egregiously). > > With only ranking information, other things being equal, I don't see any > justification for rejecting Condorcet (or Smith). Based on positional > information we can sometimes guess that some other candidate is higher > Social Utility, but probably not in a way that is reliable or isn't very > vulnerable to strategy. > > For example say this is an election for a seat in the House of > Representatives in Australia which uses compulsory full strict ranking Hare: > > 49 A>C>B > 48 B>C>A > 03 C>A>B > > The A and B supporters very likely only ranked C because they were forced > to fully rank. C is the voted Condorcet winner, but it would never cross > anyone's mind in Australia that C should be the winner. In some places C > might have struggled to get on the ballot, and in Australia would be in > danger of forfeiting his or her cash deposit (for not getting a high enough > percentage of the "primary vote".) > > If truncation was allowed (as I think it should be) then most likely the A > and B voters would have truncated and A would be the voted CW (A>B 51-49, > A>C 49-3). > > But aside from that by far the main reason why a method that fails > Condorcet might be acceptable is that the Condorcet criterion is > incompatible with other criteria that people like. Because Condorcet is > incompatible with Later-no-Help all Condorcet methods are vulnerable (to > varying degrees) to Burial strategy. > > It's a bit like comparing two engines, one performs perfectly with clean > pure fuel but very badly with dirty impure fuel and another that doesn't do > quite as well with clean fuel but copes quite a bit better with dirty > fuel. I'm thinking of course of the comparison between a Condorcet method > and Hare. > > Chris > > On 19/05/2025 9:16 am, Daniel Kirslis via Election-Methods wrote: > > Hi r b-j, > > Thank you for this response. I want to address both of your principles. > > First, is "one person, one vote". I of course agree completely that each > individual's vote should be treated exactly equally, and the K-count does > this. You say that "for any ranked ballot, this means that if Candidate A > is ranked higher than Candidate B then that is a vote for A... It doesn't > matter how many levels A is ranked higher than B, it counts as exactly one > vote for A." This is precisely how the K-count works - if A is ranked above > B on one ballot, then A advances by one along the 'preferred to B' axis. > The number of rankings between them is immaterial to A's position vis a vis > the B axis. However, if A is ranked above other candidates on that ballot, > A will also advance along those candidates' axes, so it is perhaps not > exactly "one vote". But each voter's vote has the same potential power. > > To your second principle. You say "I cannot understand why, *if* a > Condorcet winner exists, how *any* other method; Hare, Borda, Bucklin, or > Kirslis is more democratic than Condorcet." Let me give an example to > illustrate, which relates to the principle of majority rule. > > Imagine an election with 26 candidates, A, B, C... Z, and 1 million > voters. Let us suppose that candidate A is unanimously preferred to every > other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses > by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other > candidate by the same 2 vote margin, and is thus very narrowly a Condorcet > winner. Does it really reflect the will of the majority better to declare > candidate Z the winner because of his extraordinarily narrow margin over > all of the opposition when candidate A is the unanimous favorite versus > everyone but Candidate Z, to whom she barely loses? Many more preferences > are violated by choosing the Condorcet winner in this case than > choosing candidate A. This is the heart of the issue with the Condorcet > winner criteria - if a Condorcet winner exists, a Condorcet method *must* completely > ignore the size of the margins of victory, no matter how large. In my view, > this curtails the meaning of 'majority rule' in a way that feels > undemocratic. > > I am not familiar with the Burlington election that you reference, and I > will look into it when I have a chance. I don't know what the K-count would > decide in that case. But I can try to answer in principle your question > "How *possibly* can Candidate B be elected without counting those 3476 > voters' individual votes a little more (like 17% more) than how much the > votes were counted from the 4064 voters preferring Candidate A?" In the > K-count, for Candidate B to be elected in this scenario, there would need > to be a 3rd candidate (or multiple other candidates) to whom B was widely > preferred but A was not. So, B would win because the people who favored A > still preferred B to C, while the people who favored B preferred C to A. If > you only look at the head-to-head votes of A vs. B, this seems > anti-majoritarian, but the point I make in the paper is that you cannot make > valid inferences by decontextualizing the data like that, as doing so can > lead you into the logical contradiction of a Condorcet cycle. It is in the > very nature of multi-option preference aggregation that the data cannot be > decomposed in this way. Another way of thinking about this is - suppose > that while A is preferred to B, B is preferred to C, and C is preferred to > A, so you have a classic Condorcet cycle. Then, someone must be declared > the winner, so in your reasoning, someone's votes will be counted for more > than someone else's. And, when resolving this issue, most Condorcet methods > will look at the margins of victory, even though they are ignored in the > case when a Condorcet winner exists. But if margins matter enough to decide > a winner when no Condorcet winner exists, why is it okay to completely > ignore them when a Condorcet winner does exist? > > The K-count is a way of trying to reconcile Condorcet's conception of > majority rule, which looks for majority in terms of each head-to-head > matchup, with Borda's conception of majority rule, which seeks to honor the > maximum number of individual pairwise preferences. > > Thanks again for your response, and thank you for looking over the paper. > I appreciate your civil tone and good faith questions, and I hope it is > clear that the discussion here is made with full respect and in a spirit of > friendly intellectual inquiry. And I welcome your response to these > arguments! > > I am also considering the questions from other folks and am working on > responses to those as well. > > On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via > Election-Methods <election-methods@lists.electorama.com> wrote: > >> >> Hi Dan, >> >> I made one pass through your paper, but the interaction with Chris and >> Andy was helpful. I understand the definition of your K-count measure, but >> still don't understand the motivation of it, solely from the POV of >> democratic principles, which is where I draw my Condorcetist perspective. >> Admittedly, I am a hard-core Condorcet advocate, but I am so because of >> some basic principles. >> >> I read your section 9 and re-read it, and I still cannot get past how it >> justifies *any* non-Condorcet method (including your K-count) over >> Condorcet. The principles of free and fair elections in a democratic >> context require, among other things, that our votes are valued equally: >> >> 1. "One person, one vote": Every enfranchised voter has an equal >> influence on >> government in elections because of our inherent equality as citizens >> and this is >> independent of any utilitarian notion of personal investment in the >> outcome. If I >> enthusiastically prefer Candidate A and you prefer Candidate B only >> tepidly, your >> vote for Candidate B counts no less (nor more) than my vote for A. The >> effectiveness of one's vote – how much their vote counts – is not >> proportional to >> their degree of preference but is determined only by their franchise. >> A citizen with >> franchise has a vote that counts equally as much as any other citizen >> with >> franchise. For any ranked ballot, this means that if Candidate A is >> ranked higher >> than Candidate B then that is a vote for A, if only candidates A and >> B are >> contending (such as in the IRV final round). It doesn't matter how >> many levels A >> is ranked higher than B, it counts as exactly one vote for A. >> >> If our votes are not valued equally, then I want my vote to count more >> than yours. If that is unacceptable (understandably) then we must agree to >> count our votes equally. In the U.S., too many people have died over that >> inequality. So then, in order for our votes to be valued equally, we must >> have Majority Rule in single-winner elections: >> >> 2. Majority rule: If more voters mark their ballots preferring >> Candidate A over >> Candidate B than the number of voters marking their ballots to the >> contrary, >> then Candidate B is not elected. If Candidate B were to be elected, >> that would >> mean that the fewer voters preferring Candidate B had cast votes that >> had greater >> value and counted more than those votes from voters of the larger set >> preferring >> Candidate A. >> >> Those are two ways of, essentially, expressing the same principle in >> single-winner elections. For multi-winner elections, the way to value our >> votes equally would be Proportional Representation, but I don't wanna go >> there in this discussion. I would like to stay with single-winner >> elections. >> >> Now, of course this doesn't deal with the problem of cycles and we can >> discuss what the best and most democratic way to deal with cycles is, but I >> cannot understand why, *if* a Condorcet winner exists, how *any* other >> method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet. >> >> If a CW exists and we *know* (from the Cast Vote Record having ranked >> ballot data) that the CW exists and who that CW is, how is electing the >> K-count winner, assuming they're different from the CW, more democratic? >> Just like with the IRV failures, we will *know* that a smaller set of >> voters have left that election satisfied than that of a larger set of >> voters leaving the election dissatisfied. We will know that the votes >> coming from that smaller set of voters were more effective in electing >> their preferred candidate than the votes coming from the larger set of >> voters that not only preferred someone else, but they preferred a >> *specific* candidate over the one who Kirslis elected and marked their >> ballots saying so. For the very same reason that IRV failed in Burlington >> Vermont in 2009 or in Alaska in August 2022, the elected candidate will >> suffer a sense of loss of legitimacy in the election. >> >> In Burlington in 2009, 4064 voters marked their ballots that Candidate A >> was a better choice than Candidate B and 3476 voters marked their ballots >> to the contrary. (There were 1436 voters that didn't like either A or B >> and didn't rank either.) How *possibly* can Candidate B be elected without >> counting those 3476 voters' individual votes a little more (like 17% more) >> than how much the votes were counted from the 4064 voters preferring >> Candidate A? >> >> Now this is a failure of Hare (IRV) but I can construct the very same >> question for an election decided with Kirslis rules that failed to elect >> the CW when such exists. How would you answer that question? How do you >> justify satisfying a smaller set of voters at the expense of a larger set >> of voters that preferred, not just anyone else, but a specific candidate >> over the Kirslis winner? I couldn't glean an answer to that from section 9 >> (or anywhere else) in your paper. >> >> bestest, >> >> -- >> >> r b-j . _ . _ . _ . _ rbj@audioimagination.com >> >> "Imagination is more important than knowledge." >> >> . >> . >> . >> >> > On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods < >> election-methods@lists.electorama.com> wrote: >> > >> > >> > Hi all, >> > >> > Thanks so much for the replies. I’ll respond to everyone in this thread. >> > >> > Andy - I really appreciate your feedback. Your summary is correct, and >> your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of >> thinking about it that I had not considered. It seems like a potentially >> fruitful lens for understanding it. And, as perhaps you have surmised, I >> may have been mistaken in the statement about the sincere favorite >> criteria, but I am working on an analysis of the issue that I will share. >> > >> > Toby, making a short summary is a great suggestion. The argument in the >> paper is admittedly a bit convoluted before it presents the actual method. >> Here is the simplified way that I would explain it: >> > >> > Each voter ranks their preferences, with ties allowed and unranked >> candidates treated as last-place preferences. Then, for each candidate, you >> make a plot, where each axis is the total number of times that they were >> preferred to each of their opponents. So, if the candidates are A, B, and >> C, candidate A’s plot would have “number of times preferred to B” on one >> axis and “number of times preferred to C” on the other axis. Candidate B & >> C could be plotted similarly in terms of their opponents. The winner is >> simply the candidate who is plotted the farthest up and to the right, or >> closest to topmost and rightmost point, which is where a candidate who is >> the unanimous first-place choice would be plotted. The distance from that >> point is calculated using the Pythagorean theorem, which is where >> minimizing the sum of squares that Andy referenced comes in. >> > >> > The figures in the paper tell the story better than the words, as it is >> essentially a geometric idea. And, sections 4, 5, and 6 can really be >> skipped - they are more about justifying the approach than explaining it. >> > >> > Chris, you asked “Why should we be interested in the "concerns" of >> Borda (whatever they are)? And so much that we should embrace a method that >> fails the Condorcet criterion?” Great question. If you look at the Stanford >> Encyclopedia of Philosophy’s entry on Social Choice Theory, they list >> Condorcet and Borda as the original pioneers of this thinking ( >> https://plato.stanford.edu/entries/social-choice/). Borda thinks about >> majoritarianism in terms of votes, while Condorcet thinks about it in terms >> of voters. Obviously, in FPP elections, these are the same, but the heart >> of the interest in these questions comes from the tension that arises >> between them in a ranked-choice setting, where each voter has multiple >> votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a >> thinker who studies these issues and has argued most persuasively for >> Borda’s approach over Condorcet methods. In section 9 of my paper, I >> explain some of my philosophical objections to the Condorcet winner >> criterion. >> > >> > You also asked “Do you propose allowing above-bottom equal ranking or >> truncation?” Equal ranking is allowed, and unranked candidates are treated >> as last place. >> > >> > And, I am afraid I may have actually been mistaken about the sincere >> favorite property, so will have to disappoint you there. >> > >> > You asked “Who does your method elect in this example? >> > >> > 46 A >> > 44 B>C >> > 10 C” >> > >> > If I am understanding your notation correctly, A would win in this >> example. The full ranking would be: >> > A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2)) >> > B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2)) >> > C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2)) >> > >> > As you can see, when a candidate only appears as a first-place or >> last-place preference, their K-count is simply equal to the number of >> voters ranking them first. >> > >> > Thanks all! >> > >> > >> > On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) < >> elections@jenningsstory.com> wrote: >> > > Hi Dan, >> > > >> > > Great paper. Thank you for posting! >> > > >> > > It seems like the short version is that the winner is the candidate >> with the smallest sum of SQUARES of non-victories (defeats plus ties) >> against their opponents. >> > > >> > > Taking the square root and dividing can make it meaningful by scaling >> it to [0,1] or [0,s] (where s is the number of voters), but doesn't change >> the finish order. >> > > >> > > >> > > It does seem like an interesting attempt to "square the circle" >> (great pun) and compromise between Borda and Condorcet. I hadn't realized >> that Borda and Minimax are minimizing the one-norm and infinity-norm in the >> same geometric space. The two-norm certainly seems like it should be >> explored. >> > > >> > > I would love to see the proof of non-favorite-betrayal. >> > > >> > > Best, >> > > >> > > ~ Andy >> > > On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via >> Election-Methods <election-methods@lists.electorama.com> wrote: >> > > >> > > > Hello! >> > > > >> > > > I am a newcomer to this mailing list, so please forgive me if this >> message violates any norms or protocols that the members of this list >> adhere to. >> > > > >> > > > I have recently developed a novel method for tabulating >> ranked-choice elections that attempts to reconcile the concerns of Borda >> and Condorcet. I believe that it maintains the simplicity and mathematical >> elegance of the Borda count while incorporating Condorcet's concern with >> pairwise dominance. Intuitively, it can be understood as ordering >> candidates by how close they come to being unanimously selected when >> plotted in Cartesian coordinate space. Here is a link to the paper: >> > > > >> https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing >> > > > >> > > > Given its simplicity, I have been very surprised to discover that >> this method has never been proposed before. I am hoping that some of you >> all will take a look at the paper and share your comments, questions, and >> critiques. Ultimately, it is my hope that ranked-choice voting advocates >> can arrive at a consensus about the best method for RCV and thus strengthen >> efforts to adopt it and deliver much needed democratic improvements. But >> even if you don't find the system itself compelling, you may find the >> method of plotting electoral outcomes elucidated in the paper to be useful >> for the analysis of other electoral systems. >> > > > >> > > > Thank you! >> > > > >> > > > -Dan >> > > >> > > >> > ---- >> > Election-Methods mailing list - see https://electorama.com/em for list >> info >> ---- >> Election-Methods mailing list - see https://electorama.com/em for list >> info >> > > ---- > Election-Methods mailing list - see https://electorama.com/em for list info > > ---- > Election-Methods mailing list - see https://electorama.com/em for list > info >
DK
Daniel Kirslis
Tue, May 20, 2025 12:53 AM

Hi Ábel,

You are correct, I was using language imprecisely. I should say that I find
this kind of strict majoritarianism to be undemocratic.

In my response to Chris, I laid out my conception of the Borda count as
optimizing the number of voter preferences that are honored. So, it chooses
the plurality of pairwise preferences. I think this is different from
assigning any intensity to the rankings or inferring any kind of
cardinality from them.

I take your point about the tiebreakers. I have to admit that my objection
to their use is somewhat aesthetic. But I feel that the disjointedness of
using a different method to break ties than that which is used to derive
the original ranking reflects some philosophical inconsistency in the
underlying conception of preference aggregation from which the method is
derived. I know that sounds hand-wavy, so I will need to take some time to
make the idea clearer...

On Mon, May 19, 2025 at 6:35 AM Ábel Stankovics abel.stankovics@gmail.com
wrote:

"This is the heart of the issue with the Condorcet winner criteria - if a
Condorcet winner exists, a Condorcet method must completely ignore the
size of the margins of victory, no matter how large. In my view, this
curtails the meaning of 'majority rule' in a way that feels undemocratic."

I would argue that this does not curtail the meaning of majority rule, it
IS majority rule. By taking into the size of the other victories in this
case it would be something other than majority rule, maybe a "compromise"
rule, maybe something else. Note that "majority rule" (between more than 2
alternatives, as in "the will of the majorities") is not the same as "the
will of THE majority". There is a majority, when there is a faction of
more than 50%, that's when there is such a thing as "the will of the
majority". When there is no such clear majority, Condorcet allows for
different majorities to make up the difference by unanimity. To take into
account the strength of victories when there is unanimity of majorities, is
(no matter if somewhat tautological) it would not really be accurate to
call "majority rule". Similarly, in the cardinal paradigm, say Approval
voting is not majority rule, nor does it aspire to find the "the will of
the majority" (although the majority faction can force a winner of
course) - it allows for different minorities to come together and elect
someone with a plurality (also sort of compromising, and Approval is not
only cardinal, it is also a very restricted sort of ordinal system, with
only 2 ranks allowed). In Score, it is also not majority rule nor "the
will of the majority", but a plurality of cardinal-preference utilities
(it is NOT majoritarian and I think people who think in the cardinal
paradigm look at this as an advantage just as much as people in the
Condorcet paradigm think later-no-harm is not desirable). So is Borda, but
it derives hypothetical cardinal preferences more strictly, based on
ordinal preferences. This causes a high level of IIA problems.

In the cardinal paradigm, your argument for candidate A to be elected in
the example makes much more sense, since in the cardinal paradigm
preferences ARE intensities. But in the ordinal paradigm, preferences are
not intensities, but ranks, or boiled down to roots, pairwise comparisons.
If I prefer Z to A, then adding all other letters of the alphabet to the
race in-between does not make my preference stronger. So I don't really get
the intuition that all those unanimities in favor of A are at all relevant.
Yes, if I saw that in a real world election, I would also suspect they are
likely to be, but the real way to know whether they are is to embrace the
cardinal paradigm and let voters express it by themselves (with all the
questions of strategy and psychology that come with it). But if we are
still in the ordinal paradigm, nothing tells us that the size of those
victories is at all relevant, since for all we know, those are irrelevant
alternatives, or clones only running to help A. That's the weirdness of
Borda, it interprets ordinal as if were cardinal, which is far more
questionable than interpreting cardinal preferences as ordinal, for
example. But not only do we disagree whether is "feels undemocratic", but
also, by your own arguments, such intuition can be wrong.

"But if margins matter enough to decide a winner when no Condorcet winner
exists, why is it okay to completely ignore them when a Condorcet winner
does exist?"

It is a tiebreaker (well strictly speaking, only Smith methods are the
tiebreakers, other methods are tiebreakers that can give the win to those
behind the ties for first place). The same way are FPP is a tiebreaker for
unanimity or the absolute majority principle, or Condorcet is one for
either. You can imagine any sort of line of subsidiary rules from unanimity
to a Condorcet method. At some point, 2/3 supermajority was a subsidiary
rule for when there is no unanimity, absolute majority for when there is no
supermajority, plurality or Condorcet when there is no absolute majority,
and when there is no CW, or there is a tie for plurality, etc., then other
tiebreakers can be used.

I don't see how the Condorcet paradox alone is any argument against it's
concept of majority rule, just as Arrow's theory does not seem like an
argument against the unanimity principle.

On Mon, May 19, 2025 at 1:47 AM Daniel Kirslis via Election-Methods <
election-methods@lists.electorama.com> wrote:

Hi r b-j,

Thank you for this response. I want to address both of your principles.

First, is "one person, one vote". I of course agree completely that each
individual's vote should be treated exactly equally, and the K-count does
this. You say that "for any ranked ballot, this means that if Candidate A
is ranked higher than Candidate B then that is a vote for A... It doesn't
matter how many levels A is ranked higher than B, it counts as exactly one
vote for A." This is precisely how the K-count works - if A is ranked above
B on one ballot, then A advances by one along the 'preferred to B' axis.
The number of rankings between them is immaterial to A's position vis a vis
the B axis. However, if A is ranked above other candidates on that ballot,
A will also advance along those candidates' axes, so it is perhaps not
exactly "one vote". But each voter's vote has the same potential power.

To your second principle. You say "I cannot understand why, if a
Condorcet winner exists, how any other method; Hare, Borda, Bucklin, or
Kirslis is more democratic than Condorcet." Let me give an example to
illustrate, which relates to the principle of majority rule.

Imagine an election with 26 candidates, A, B, C... Z, and 1 million
voters. Let us suppose that candidate A is unanimously preferred to every
other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses
by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other
candidate by the same 2 vote margin, and is thus very narrowly a Condorcet
winner. Does it really reflect the will of the majority better to declare
candidate Z the winner because of his extraordinarily narrow margin over
all of the opposition when candidate A is the unanimous favorite versus
everyone but Candidate Z, to whom she barely loses? Many more preferences
are violated by choosing the Condorcet winner in this case than
choosing candidate A. This is the heart of the issue with the Condorcet
winner criteria - if a Condorcet winner exists, a Condorcet method must completely
ignore the size of the margins of victory, no matter how large. In my view,
this curtails the meaning of 'majority rule' in a way that feels
undemocratic.

I am not familiar with the Burlington election that you reference, and I
will look into it when I have a chance. I don't know what the K-count would
decide in that case. But I can try to answer in principle your question
"How possibly can Candidate B be elected without counting those 3476
voters' individual votes a little more (like 17% more) than how much the
votes were counted from the 4064 voters preferring Candidate A?" In the
K-count, for Candidate B to be elected in this scenario, there would need
to be a 3rd candidate (or multiple other candidates) to whom B was widely
preferred but A was not. So, B would win because the people who favored A
still preferred B to C, while the people who favored B preferred C to A. If
you only look at the head-to-head votes of A vs. B, this seems
anti-majoritarian, but the point I make in the paper is that you cannot make
valid inferences by decontextualizing the data like that, as doing so can
lead you into the logical contradiction of a Condorcet cycle. It is in the
very nature of multi-option preference aggregation that the data cannot be
decomposed in this way. Another way of thinking about this is - suppose
that while A is preferred to B, B is preferred to C, and C is preferred to
A, so you have a classic Condorcet cycle. Then, someone must be declared
the winner, so in your reasoning, someone's votes will be counted for more
than someone else's. And, when resolving this issue, most Condorcet methods
will look at the margins of victory, even though they are ignored in the
case when a Condorcet winner exists. But if margins matter enough to decide
a winner when no Condorcet winner exists, why is it okay to completely
ignore them when a Condorcet winner does exist?

The K-count is a way of trying to reconcile Condorcet's conception of
majority rule, which looks for majority in terms of each head-to-head
matchup, with Borda's conception of majority rule, which seeks to honor the
maximum number of individual pairwise preferences.

Thanks again for your response, and thank you for looking over the paper.
I appreciate your civil tone and good faith questions, and I hope it is
clear that the discussion here is made with full respect and in a spirit of
friendly intellectual inquiry. And I welcome your response to these
arguments!

I am also considering the questions from other folks and am working on
responses to those as well.

On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via
Election-Methods election-methods@lists.electorama.com wrote:

Hi Dan,

I made one pass through your paper, but the interaction with Chris and
Andy was helpful.  I understand the definition of your K-count measure, but
still don't understand the motivation of it, solely from the POV of
democratic principles, which is where I draw my Condorcetist perspective.
Admittedly, I am a hard-core Condorcet advocate, but I am so because of
some basic principles.

I read your section 9 and re-read it, and I still cannot get past how it
justifies any non-Condorcet method (including your K-count) over
Condorcet.  The principles of free and fair elections in a democratic
context require, among other things, that our votes are valued equally:

 1. "One person, one vote": Every enfranchised voter has an equal

influence on
government in elections because of our inherent equality as citizens
and this is
independent of any utilitarian notion of personal investment in the
outcome. If I
enthusiastically prefer Candidate A and you prefer Candidate B only
tepidly, your
vote for Candidate B counts no less (nor more) than my vote for A.
The
effectiveness of one's vote – how much their vote counts – is not
proportional to
their degree of preference but is determined only by their
franchise. A citizen with
franchise has a vote that counts equally as much as any other
citizen with
franchise. For any ranked ballot, this means that if Candidate A is
ranked higher
than Candidate B then that is a vote for A, if only candidates A and
B are
contending (such as in the IRV final round). It doesn't matter how
many levels A
is ranked higher than B, it counts as exactly one vote for A.

If our votes are not valued equally, then I want my vote to count more
than yours.  If that is unacceptable (understandably) then we must agree to
count our votes equally.  In the U.S., too many people have died over that
inequality.  So then, in order for our votes to be valued equally, we must
have Majority Rule in single-winner elections:

 2. Majority rule: If more voters mark their ballots preferring

Candidate A over
Candidate B than the number of voters marking their ballots to the
contrary,
then Candidate B is not elected. If Candidate B were to be elected,
that would
mean that the fewer voters preferring Candidate B had cast votes
that had greater
value and counted more than those votes from voters of the larger
set preferring
Candidate A.

Those are two ways of, essentially, expressing the same principle in
single-winner elections.  For multi-winner elections, the way to value our
votes equally would be Proportional Representation, but I don't wanna go
there in this discussion.  I would like to stay with single-winner
elections.

Now, of course this doesn't deal with the problem of cycles and we can
discuss what the best and most democratic way to deal with cycles is, but I
cannot understand why, if a Condorcet winner exists, how any other
method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet.

If a CW exists and we know (from the Cast Vote Record having ranked
ballot data) that the CW exists and who that CW is, how is electing the
K-count winner, assuming they're different from the CW, more democratic?
Just like with the IRV failures, we will know that a smaller set of
voters have left that election satisfied than that of a larger set of
voters leaving the election dissatisfied.  We will know that the votes
coming from that smaller set of voters were more effective in electing
their preferred candidate than the votes coming from the larger set of
voters that not only preferred someone else, but they preferred a
specific candidate over the one who Kirslis elected and marked their
ballots saying so.  For the very same reason that IRV failed in Burlington
Vermont in 2009 or in Alaska in August 2022, the elected candidate will
suffer a sense of loss of legitimacy in the election.

In Burlington in 2009, 4064 voters marked their ballots that Candidate A
was a better choice than Candidate B and 3476 voters marked their ballots
to the contrary.  (There were 1436 voters that didn't like either A or B
and didn't rank either.)  How possibly can Candidate B be elected without
counting those 3476 voters' individual votes a little more (like 17% more)
than how much the votes were counted from the 4064 voters preferring
Candidate A?

Now this is a failure of Hare (IRV) but I can construct the very same
question for an election decided with Kirslis rules that failed to elect
the CW when such exists.  How would you answer that question?  How do you
justify satisfying a smaller set of voters at the expense of a larger set
of voters that preferred, not just anyone else, but a specific candidate
over the Kirslis winner?  I couldn't glean an answer to that from section 9
(or anywhere else) in your paper.

bestest,

--

r b-j . _ . _ . _ . _ rbj@audioimagination.com

"Imagination is more important than knowledge."

.
.
.

On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods <

Hi all,

Thanks so much for the replies. I’ll respond to everyone in this

thread.

Andy - I really appreciate your feedback. Your summary is correct, and

your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of
thinking about it that I had not considered. It seems like a potentially
fruitful lens for understanding it. And, as perhaps you have surmised, I
may have been mistaken in the statement about the sincere favorite
criteria, but I am working on an analysis of the issue that I will share.

Toby, making a short summary is a great suggestion. The argument in

the paper is admittedly a bit convoluted before it presents the actual
method. Here is the simplified way that I would explain it:

Each voter ranks their preferences, with ties allowed and unranked

candidates treated as last-place preferences. Then, for each candidate, you
make a plot, where each axis is the total number of times that they were
preferred to each of their opponents. So, if the candidates are A, B, and
C, candidate A’s plot would have “number of times preferred to B” on one
axis and “number of times preferred to C” on the other axis. Candidate B &
C could be plotted similarly in terms of their opponents. The winner is
simply the candidate who is plotted the farthest up and to the right, or
closest to topmost and rightmost point, which is where a candidate who is
the unanimous first-place choice would be plotted. The distance from that
point is calculated using the Pythagorean theorem, which is where
minimizing the sum of squares that Andy referenced comes in.

The figures in the paper tell the story better than the words, as it

is essentially a geometric idea. And, sections 4, 5, and 6 can really be
skipped - they are more about justifying the approach than explaining it.

Chris, you asked “Why should we be interested in the "concerns" of

Borda (whatever they are)? And so much that we should embrace a method that
fails the Condorcet criterion?” Great question. If you look at the Stanford
Encyclopedia of Philosophy’s entry on Social Choice Theory, they list
Condorcet and Borda as the original pioneers of this thinking (
https://plato.stanford.edu/entries/social-choice/). Borda thinks about
majoritarianism in terms of votes, while Condorcet thinks about it in terms
of voters. Obviously, in FPP elections, these are the same, but the heart
of the interest in these questions comes from the tension that arises
between them in a ranked-choice setting, where each voter has multiple
votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a
thinker who studies these issues and has argued most persuasively for
Borda’s approach over Condorcet methods. In section 9 of my paper, I
explain some of my philosophical objections to the Condorcet winner
criterion.

You also asked “Do you propose allowing above-bottom equal ranking or

truncation?” Equal ranking is allowed, and unranked candidates are treated
as last place.

And, I am afraid I may have actually been mistaken about the sincere

favorite property, so will have to disappoint you there.

You asked “Who does your method elect in this example?

46 A
44 B>C
10 C”

If I am understanding your notation correctly, A would win in this

example. The full ranking would be:

A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2))
B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2))
C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2))

As you can see, when a candidate only appears as a first-place or

last-place preference, their K-count is simply equal to the number of
voters ranking them first.

Thanks all!

On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) <

Hi Dan,

Great paper. Thank you for posting!

It seems like the short version is that the winner is the candidate

with the smallest sum of SQUARES of non-victories (defeats plus ties)
against their opponents.

Taking the square root and dividing can make it meaningful by

scaling it to [0,1] or [0,s] (where s is the number of voters), but doesn't
change the finish order.

It does seem like an interesting attempt to "square the circle"

(great pun) and compromise between Borda and Condorcet. I hadn't realized
that Borda and Minimax are minimizing the one-norm and infinity-norm in the
same geometric space. The two-norm certainly seems like it should be
explored.

I would love to see the proof of non-favorite-betrayal.

Best,

~ Andy
On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via

Election-Methods election-methods@lists.electorama.com wrote:

Hello!

I am a newcomer to this mailing list, so please forgive me if this

message violates any norms or protocols that the members of this list
adhere to.

I have recently developed a novel method for tabulating

ranked-choice elections that attempts to reconcile the concerns of Borda
and Condorcet. I believe that it maintains the simplicity and mathematical
elegance of the Borda count while incorporating Condorcet's concern with
pairwise dominance. Intuitively, it can be understood as ordering
candidates by how close they come to being unanimously selected when
plotted in Cartesian coordinate space. Here is a link to the paper:

Given its simplicity, I have been very surprised to discover that

this method has never been proposed before. I am hoping that some of you
all will take a look at the paper and share your comments, questions, and
critiques. Ultimately, it is my hope that ranked-choice voting advocates
can arrive at a consensus about the best method for RCV and thus strengthen
efforts to adopt it and deliver much needed democratic improvements. But
even if you don't find the system itself compelling, you may find the
method of plotting electoral outcomes elucidated in the paper to be useful
for the analysis of other electoral systems.

Thank you!

-Dan


Election-Methods mailing list - see https://electorama.com/em for

list info

Election-Methods mailing list - see https://electorama.com/em for list
info


Election-Methods mailing list - see https://electorama.com/em for list
info

Hi Ábel, You are correct, I was using language imprecisely. I should say that I find this kind of strict majoritarianism to be undemocratic. In my response to Chris, I laid out my conception of the Borda count as optimizing the number of voter preferences that are honored. So, it chooses the plurality of pairwise preferences. I think this is different from assigning any intensity to the rankings or inferring any kind of cardinality from them. I take your point about the tiebreakers. I have to admit that my objection to their use is somewhat aesthetic. But I feel that the disjointedness of using a different method to break ties than that which is used to derive the original ranking reflects some philosophical inconsistency in the underlying conception of preference aggregation from which the method is derived. I know that sounds hand-wavy, so I will need to take some time to make the idea clearer... On Mon, May 19, 2025 at 6:35 AM Ábel Stankovics <abel.stankovics@gmail.com> wrote: > "This is the heart of the issue with the Condorcet winner criteria - if a > Condorcet winner exists, a Condorcet method *must* completely ignore the > size of the margins of victory, no matter how large. In my view, this > curtails the meaning of 'majority rule' in a way that feels undemocratic." > > I would argue that this does not curtail the meaning of majority rule, it > IS majority rule. By taking into the size of the other victories in this > case it would be something other than majority rule, maybe a "compromise" > rule, maybe something else. Note that "majority rule" (between more than 2 > alternatives, as in "the will of the majorities") is not the same as "the > will of THE majority". There is a majority, when there is a faction of > more than 50%, that's when there is such a thing as "the will of the > majority". When there is no such clear majority, Condorcet allows for > different majorities to make up the difference by unanimity. To take into > account the strength of victories when there is unanimity of majorities, is > (no matter if somewhat tautological) it would not really be accurate to > call "majority rule". Similarly, in the cardinal paradigm, say Approval > voting is not majority rule, nor does it aspire to find the "the will of > the majority" (although the majority faction can force a winner of > course) - it allows for different minorities to come together and elect > someone with a plurality (also sort of compromising, and Approval is not > only cardinal, it is also a very restricted sort of ordinal system, with > only 2 ranks allowed). In Score, it is also not majority rule nor "the > will of the majority", but a plurality of cardinal-preference utilities > (it is NOT majoritarian and I think people who think in the cardinal > paradigm look at this as an advantage just as much as people in the > Condorcet paradigm think later-no-harm is not desirable). So is Borda, but > it derives hypothetical cardinal preferences more strictly, based on > ordinal preferences. This causes a high level of IIA problems. > > In the cardinal paradigm, your argument for candidate A to be elected in > the example makes much more sense, since in the cardinal paradigm > preferences ARE intensities. But in the ordinal paradigm, preferences are > not intensities, but ranks, or boiled down to roots, pairwise comparisons. > If I prefer Z to A, then adding all other letters of the alphabet to the > race in-between does not make my preference stronger. So I don't really get > the intuition that all those unanimities in favor of A are at all relevant. > Yes, if I saw that in a real world election, I would also suspect they are > likely to be, but the real way to know whether they are is to embrace the > cardinal paradigm and let voters express it by themselves (with all the > questions of strategy and psychology that come with it). But if we are > still in the ordinal paradigm, nothing tells us that the size of those > victories is at all relevant, since for all we know, those are irrelevant > alternatives, or clones only running to help A. That's the weirdness of > Borda, it interprets ordinal as if were cardinal, which is far more > questionable than interpreting cardinal preferences as ordinal, for > example. But not only do we disagree whether is "feels undemocratic", but > also, by your own arguments, such intuition can be wrong. > > "But if margins matter enough to decide a winner when no Condorcet winner > exists, why is it okay to completely ignore them when a Condorcet winner > does exist?" > > It is a tiebreaker (well strictly speaking, only Smith methods are the > tiebreakers, other methods are tiebreakers that can give the win to those > behind the ties for first place). The same way are FPP is a tiebreaker for > unanimity or the absolute majority principle, or Condorcet is one for > either. You can imagine any sort of line of subsidiary rules from unanimity > to a Condorcet method. At some point, 2/3 supermajority was a subsidiary > rule for when there is no unanimity, absolute majority for when there is no > supermajority, plurality or Condorcet when there is no absolute majority, > and when there is no CW, or there is a tie for plurality, etc., then other > tiebreakers can be used. > > I don't see how the Condorcet paradox alone is any argument against it's > concept of majority rule, just as Arrow's theory does not seem like an > argument against the unanimity principle. > > > On Mon, May 19, 2025 at 1:47 AM Daniel Kirslis via Election-Methods < > election-methods@lists.electorama.com> wrote: > >> Hi r b-j, >> >> Thank you for this response. I want to address both of your principles. >> >> First, is "one person, one vote". I of course agree completely that each >> individual's vote should be treated exactly equally, and the K-count does >> this. You say that "for any ranked ballot, this means that if Candidate A >> is ranked higher than Candidate B then that is a vote for A... It doesn't >> matter how many levels A is ranked higher than B, it counts as exactly one >> vote for A." This is precisely how the K-count works - if A is ranked above >> B on one ballot, then A advances by one along the 'preferred to B' axis. >> The number of rankings between them is immaterial to A's position vis a vis >> the B axis. However, if A is ranked above other candidates on that ballot, >> A will also advance along those candidates' axes, so it is perhaps not >> exactly "one vote". But each voter's vote has the same potential power. >> >> To your second principle. You say "I cannot understand why, *if* a >> Condorcet winner exists, how *any* other method; Hare, Borda, Bucklin, or >> Kirslis is more democratic than Condorcet." Let me give an example to >> illustrate, which relates to the principle of majority rule. >> >> Imagine an election with 26 candidates, A, B, C... Z, and 1 million >> voters. Let us suppose that candidate A is unanimously preferred to every >> other candidate, 1,000,000 to 0, except for candidate Z, to whom she loses >> by 2 votes, 500,001 to 499,999. Meanwhile, candidate Z beats every other >> candidate by the same 2 vote margin, and is thus very narrowly a Condorcet >> winner. Does it really reflect the will of the majority better to declare >> candidate Z the winner because of his extraordinarily narrow margin over >> all of the opposition when candidate A is the unanimous favorite versus >> everyone but Candidate Z, to whom she barely loses? Many more preferences >> are violated by choosing the Condorcet winner in this case than >> choosing candidate A. This is the heart of the issue with the Condorcet >> winner criteria - if a Condorcet winner exists, a Condorcet method *must* completely >> ignore the size of the margins of victory, no matter how large. In my view, >> this curtails the meaning of 'majority rule' in a way that feels >> undemocratic. >> >> I am not familiar with the Burlington election that you reference, and I >> will look into it when I have a chance. I don't know what the K-count would >> decide in that case. But I can try to answer in principle your question >> "How *possibly* can Candidate B be elected without counting those 3476 >> voters' individual votes a little more (like 17% more) than how much the >> votes were counted from the 4064 voters preferring Candidate A?" In the >> K-count, for Candidate B to be elected in this scenario, there would need >> to be a 3rd candidate (or multiple other candidates) to whom B was widely >> preferred but A was not. So, B would win because the people who favored A >> still preferred B to C, while the people who favored B preferred C to A. If >> you only look at the head-to-head votes of A vs. B, this seems >> anti-majoritarian, but the point I make in the paper is that you cannot make >> valid inferences by decontextualizing the data like that, as doing so can >> lead you into the logical contradiction of a Condorcet cycle. It is in the >> very nature of multi-option preference aggregation that the data cannot be >> decomposed in this way. Another way of thinking about this is - suppose >> that while A is preferred to B, B is preferred to C, and C is preferred to >> A, so you have a classic Condorcet cycle. Then, someone must be declared >> the winner, so in your reasoning, someone's votes will be counted for more >> than someone else's. And, when resolving this issue, most Condorcet methods >> will look at the margins of victory, even though they are ignored in the >> case when a Condorcet winner exists. But if margins matter enough to decide >> a winner when no Condorcet winner exists, why is it okay to completely >> ignore them when a Condorcet winner does exist? >> >> The K-count is a way of trying to reconcile Condorcet's conception of >> majority rule, which looks for majority in terms of each head-to-head >> matchup, with Borda's conception of majority rule, which seeks to honor the >> maximum number of individual pairwise preferences. >> >> Thanks again for your response, and thank you for looking over the paper. >> I appreciate your civil tone and good faith questions, and I hope it is >> clear that the discussion here is made with full respect and in a spirit of >> friendly intellectual inquiry. And I welcome your response to these >> arguments! >> >> I am also considering the questions from other folks and am working on >> responses to those as well. >> >> On Sun, May 18, 2025 at 3:30 PM robert bristow-johnson via >> Election-Methods <election-methods@lists.electorama.com> wrote: >> >>> >>> Hi Dan, >>> >>> I made one pass through your paper, but the interaction with Chris and >>> Andy was helpful. I understand the definition of your K-count measure, but >>> still don't understand the motivation of it, solely from the POV of >>> democratic principles, which is where I draw my Condorcetist perspective. >>> Admittedly, I am a hard-core Condorcet advocate, but I am so because of >>> some basic principles. >>> >>> I read your section 9 and re-read it, and I still cannot get past how it >>> justifies *any* non-Condorcet method (including your K-count) over >>> Condorcet. The principles of free and fair elections in a democratic >>> context require, among other things, that our votes are valued equally: >>> >>> 1. "One person, one vote": Every enfranchised voter has an equal >>> influence on >>> government in elections because of our inherent equality as citizens >>> and this is >>> independent of any utilitarian notion of personal investment in the >>> outcome. If I >>> enthusiastically prefer Candidate A and you prefer Candidate B only >>> tepidly, your >>> vote for Candidate B counts no less (nor more) than my vote for A. >>> The >>> effectiveness of one's vote – how much their vote counts – is not >>> proportional to >>> their degree of preference but is determined only by their >>> franchise. A citizen with >>> franchise has a vote that counts equally as much as any other >>> citizen with >>> franchise. For any ranked ballot, this means that if Candidate A is >>> ranked higher >>> than Candidate B then that is a vote for A, if only candidates A and >>> B are >>> contending (such as in the IRV final round). It doesn't matter how >>> many levels A >>> is ranked higher than B, it counts as exactly one vote for A. >>> >>> If our votes are not valued equally, then I want my vote to count more >>> than yours. If that is unacceptable (understandably) then we must agree to >>> count our votes equally. In the U.S., too many people have died over that >>> inequality. So then, in order for our votes to be valued equally, we must >>> have Majority Rule in single-winner elections: >>> >>> 2. Majority rule: If more voters mark their ballots preferring >>> Candidate A over >>> Candidate B than the number of voters marking their ballots to the >>> contrary, >>> then Candidate B is not elected. If Candidate B were to be elected, >>> that would >>> mean that the fewer voters preferring Candidate B had cast votes >>> that had greater >>> value and counted more than those votes from voters of the larger >>> set preferring >>> Candidate A. >>> >>> Those are two ways of, essentially, expressing the same principle in >>> single-winner elections. For multi-winner elections, the way to value our >>> votes equally would be Proportional Representation, but I don't wanna go >>> there in this discussion. I would like to stay with single-winner >>> elections. >>> >>> Now, of course this doesn't deal with the problem of cycles and we can >>> discuss what the best and most democratic way to deal with cycles is, but I >>> cannot understand why, *if* a Condorcet winner exists, how *any* other >>> method; Hare, Borda, Bucklin, or Kirslis is more democratic than Condorcet. >>> >>> If a CW exists and we *know* (from the Cast Vote Record having ranked >>> ballot data) that the CW exists and who that CW is, how is electing the >>> K-count winner, assuming they're different from the CW, more democratic? >>> Just like with the IRV failures, we will *know* that a smaller set of >>> voters have left that election satisfied than that of a larger set of >>> voters leaving the election dissatisfied. We will know that the votes >>> coming from that smaller set of voters were more effective in electing >>> their preferred candidate than the votes coming from the larger set of >>> voters that not only preferred someone else, but they preferred a >>> *specific* candidate over the one who Kirslis elected and marked their >>> ballots saying so. For the very same reason that IRV failed in Burlington >>> Vermont in 2009 or in Alaska in August 2022, the elected candidate will >>> suffer a sense of loss of legitimacy in the election. >>> >>> In Burlington in 2009, 4064 voters marked their ballots that Candidate A >>> was a better choice than Candidate B and 3476 voters marked their ballots >>> to the contrary. (There were 1436 voters that didn't like either A or B >>> and didn't rank either.) How *possibly* can Candidate B be elected without >>> counting those 3476 voters' individual votes a little more (like 17% more) >>> than how much the votes were counted from the 4064 voters preferring >>> Candidate A? >>> >>> Now this is a failure of Hare (IRV) but I can construct the very same >>> question for an election decided with Kirslis rules that failed to elect >>> the CW when such exists. How would you answer that question? How do you >>> justify satisfying a smaller set of voters at the expense of a larger set >>> of voters that preferred, not just anyone else, but a specific candidate >>> over the Kirslis winner? I couldn't glean an answer to that from section 9 >>> (or anywhere else) in your paper. >>> >>> bestest, >>> >>> -- >>> >>> r b-j . _ . _ . _ . _ rbj@audioimagination.com >>> >>> "Imagination is more important than knowledge." >>> >>> . >>> . >>> . >>> >>> > On 05/18/2025 1:51 PM EDT Daniel Kirslis via Election-Methods < >>> election-methods@lists.electorama.com> wrote: >>> > >>> > >>> > Hi all, >>> > >>> > Thanks so much for the replies. I’ll respond to everyone in this >>> thread. >>> > >>> > Andy - I really appreciate your feedback. Your summary is correct, and >>> your framing of it as one-norm vs. two-norm vs. infinity-norm is a way of >>> thinking about it that I had not considered. It seems like a potentially >>> fruitful lens for understanding it. And, as perhaps you have surmised, I >>> may have been mistaken in the statement about the sincere favorite >>> criteria, but I am working on an analysis of the issue that I will share. >>> > >>> > Toby, making a short summary is a great suggestion. The argument in >>> the paper is admittedly a bit convoluted before it presents the actual >>> method. Here is the simplified way that I would explain it: >>> > >>> > Each voter ranks their preferences, with ties allowed and unranked >>> candidates treated as last-place preferences. Then, for each candidate, you >>> make a plot, where each axis is the total number of times that they were >>> preferred to each of their opponents. So, if the candidates are A, B, and >>> C, candidate A’s plot would have “number of times preferred to B” on one >>> axis and “number of times preferred to C” on the other axis. Candidate B & >>> C could be plotted similarly in terms of their opponents. The winner is >>> simply the candidate who is plotted the farthest up and to the right, or >>> closest to topmost and rightmost point, which is where a candidate who is >>> the unanimous first-place choice would be plotted. The distance from that >>> point is calculated using the Pythagorean theorem, which is where >>> minimizing the sum of squares that Andy referenced comes in. >>> > >>> > The figures in the paper tell the story better than the words, as it >>> is essentially a geometric idea. And, sections 4, 5, and 6 can really be >>> skipped - they are more about justifying the approach than explaining it. >>> > >>> > Chris, you asked “Why should we be interested in the "concerns" of >>> Borda (whatever they are)? And so much that we should embrace a method that >>> fails the Condorcet criterion?” Great question. If you look at the Stanford >>> Encyclopedia of Philosophy’s entry on Social Choice Theory, they list >>> Condorcet and Borda as the original pioneers of this thinking ( >>> https://plato.stanford.edu/entries/social-choice/). Borda thinks about >>> majoritarianism in terms of votes, while Condorcet thinks about it in terms >>> of voters. Obviously, in FPP elections, these are the same, but the heart >>> of the interest in these questions comes from the tension that arises >>> between them in a ranked-choice setting, where each voter has multiple >>> votes and ‘majoritarianism’ is no longer simple to define. Don Saari is a >>> thinker who studies these issues and has argued most persuasively for >>> Borda’s approach over Condorcet methods. In section 9 of my paper, I >>> explain some of my philosophical objections to the Condorcet winner >>> criterion. >>> > >>> > You also asked “Do you propose allowing above-bottom equal ranking or >>> truncation?” Equal ranking is allowed, and unranked candidates are treated >>> as last place. >>> > >>> > And, I am afraid I may have actually been mistaken about the sincere >>> favorite property, so will have to disappoint you there. >>> > >>> > You asked “Who does your method elect in this example? >>> > >>> > 46 A >>> > 44 B>C >>> > 10 C” >>> > >>> > If I am understanding your notation correctly, A would win in this >>> example. The full ranking would be: >>> > A's K-count = 46 = 100-SQRT((100-46)^2+(100-46)^2)/(SQRT(2)) >>> > B's K-count = 44 = 100-SQRT((100-44)^2+(100-44)^2)/(SQRT(2)) >>> > C's K-count = 28.53 = 100-SQRT((100-54)^2+(100-10)^2)/(SQRT(2)) >>> > >>> > As you can see, when a candidate only appears as a first-place or >>> last-place preference, their K-count is simply equal to the number of >>> voters ranking them first. >>> > >>> > Thanks all! >>> > >>> > >>> > On Sun, May 18, 2025 at 12:10 PM Andrew B Jennings (elections) < >>> elections@jenningsstory.com> wrote: >>> > > Hi Dan, >>> > > >>> > > Great paper. Thank you for posting! >>> > > >>> > > It seems like the short version is that the winner is the candidate >>> with the smallest sum of SQUARES of non-victories (defeats plus ties) >>> against their opponents. >>> > > >>> > > Taking the square root and dividing can make it meaningful by >>> scaling it to [0,1] or [0,s] (where s is the number of voters), but doesn't >>> change the finish order. >>> > > >>> > > >>> > > It does seem like an interesting attempt to "square the circle" >>> (great pun) and compromise between Borda and Condorcet. I hadn't realized >>> that Borda and Minimax are minimizing the one-norm and infinity-norm in the >>> same geometric space. The two-norm certainly seems like it should be >>> explored. >>> > > >>> > > I would love to see the proof of non-favorite-betrayal. >>> > > >>> > > Best, >>> > > >>> > > ~ Andy >>> > > On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via >>> Election-Methods <election-methods@lists.electorama.com> wrote: >>> > > >>> > > > Hello! >>> > > > >>> > > > I am a newcomer to this mailing list, so please forgive me if this >>> message violates any norms or protocols that the members of this list >>> adhere to. >>> > > > >>> > > > I have recently developed a novel method for tabulating >>> ranked-choice elections that attempts to reconcile the concerns of Borda >>> and Condorcet. I believe that it maintains the simplicity and mathematical >>> elegance of the Borda count while incorporating Condorcet's concern with >>> pairwise dominance. Intuitively, it can be understood as ordering >>> candidates by how close they come to being unanimously selected when >>> plotted in Cartesian coordinate space. Here is a link to the paper: >>> > > > >>> https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing >>> > > > >>> > > > Given its simplicity, I have been very surprised to discover that >>> this method has never been proposed before. I am hoping that some of you >>> all will take a look at the paper and share your comments, questions, and >>> critiques. Ultimately, it is my hope that ranked-choice voting advocates >>> can arrive at a consensus about the best method for RCV and thus strengthen >>> efforts to adopt it and deliver much needed democratic improvements. But >>> even if you don't find the system itself compelling, you may find the >>> method of plotting electoral outcomes elucidated in the paper to be useful >>> for the analysis of other electoral systems. >>> > > > >>> > > > Thank you! >>> > > > >>> > > > -Dan >>> > > >>> > > >>> > ---- >>> > Election-Methods mailing list - see https://electorama.com/em for >>> list info >>> ---- >>> Election-Methods mailing list - see https://electorama.com/em for list >>> info >>> >> ---- >> Election-Methods mailing list - see https://electorama.com/em for list >> info >> >
CB
Chris Benham
Wed, May 21, 2025 1:29 PM

Dan,

The new short version of your paper I also find opaque. Earlier you
agreed with Andrew that

It seems like the short version is that the winner is the candidate
with the smallest sum of SQUARES of non-victories (defeats plus ties)
against their opponents.

And then you told me that in this example

46 A
44 B>C
10 C

your  K-count method elects A.

C>A 54-46,   A>B  46-44,   B<C 44-10

Each candidate has only one "non-victory".  So then I take it then,
using Andrew's version  the winner is C, because squaring the pairwise
non-victory scores of  C44,  B46,  A54 doesn't change their order and
C's is the smallest.

Obviously one of us has it wrong.

Chris

On 20/05/2025 8:58 am, Daniel Kirslis via Election-Methods wrote:

Hi Chris,

Yes, that is correct. I have created a simplified version of the paper
that attempts to explain the method in the most concise possible way.
It's only two pages:
https://drive.google.com/file/d/1F_I2ZBUKXKbmcS-uSvMAf_gNdNO8m0GB/view?usp=drive_link

It skips over a lot of the background that explains why I view this as
a compromise between the Borda count and Condorcet methods and just
focuses on explaining the method itself. Once you see how the plotting
works, it is like Bocce Ball - closest to the target ball wins.

Thank you for your engagement on this. I should have started with this
version of the paper!

On Mon, May 19, 2025 at 12:32 PM Chris Benham via Election-Methods
election-methods@lists.electorama.com wrote:

 It seems like the short version is that the winner is the
 candidate with the smallest sum of SQUARES of non-victories
 (defeats plus ties) against their opponents.
 I take that these numbers you are squaring are the candidate's
 opposing and tying vote scores, and not simply the number of such
 results. Is that right?

 Because otherwise that would often be very indecisive, like Copeland.


 On 19/05/2025 1:40 am, Andrew B Jennings (elections) via
 Election-Methods wrote:
 Hi Dan,

 Great paper. Thank you for posting!

 It seems like the short version is that the winner is the
 candidate with the smallest sum of SQUARES of non-victories
 (defeats plus ties) against their opponents.

 Taking the square root and dividing can make it meaningful by
 scaling it to [0,1] or [0,s] (where s is the number of voters),
 but doesn't change the finish order.

 It does seem like an interesting attempt to "square the circle"
 (great pun) and compromise between Borda and Condorcet. I hadn't
 realized that Borda and Minimax are minimizing the one-norm and
 infinity-norm in the same geometric space. The two-norm certainly
 seems like it should be explored.

 I would love to see the proof of non-favorite-betrayal.

 Best,

 ~ Andy
 On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via
 Election-Methods <election-methods@lists.electorama.com>
 <mailto:election-methods@lists.electorama.com> wrote:
 Hello!

 I am a newcomer to this mailing list, so please forgive me if
 this message violates any norms or protocols that the members of
 this list adhere to.

 I have recently developed a novel method for tabulating
 ranked-choice elections that attempts to reconcile the concerns
 of Borda and Condorcet. I believe that it maintains the
 simplicity and mathematical elegance of the Borda count while
 incorporating Condorcet's concern with pairwise dominance.
 Intuitively, it can be understood as ordering candidates by how
 close they come to being unanimously selected when plotted in
 Cartesian coordinate space. Here is a link to the paper:
 https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing

 Given its simplicity, I have been very surprised to discover
 that this method has never been proposed before. I am hoping
 that some of you all will take a look at the paper and share
 your comments, questions, and critiques. Ultimately, it is my
 hope that ranked-choice voting advocates can arrive at a
 consensus about the best method for RCV and thus strengthen
 efforts to adopt it and deliver much needed democratic
 improvements. But even if you don't find the system itself
 compelling, you may find the method of plotting electoral
 outcomes elucidated in the paper to be useful for the analysis
 of other electoral systems.

 Thank you!

 -Dan
 ----
 Election-Methods mailing list - seehttps://electorama.com/em for list info
 ----
 Election-Methods mailing list - see https://electorama.com/em for
 list info

Election-Methods mailing list - seehttps://electorama.com/em for list info

Dan, The new short version of your paper I also find opaque. Earlier you agreed with Andrew that > It seems like the short version is that the winner is the candidate > with the smallest sum of SQUARES of non-victories (defeats plus ties) > against their opponents. And then you told me that in this example 46 A 44 B>C 10 C your  K-count method elects A. C>A 54-46,   A>B  46-44,   B<C 44-10 Each candidate has only one "non-victory".  So then I take it then, using Andrew's version  the winner is C, because squaring the pairwise non-victory scores of  C44,  B46,  A54 doesn't change their order and C's is the smallest. Obviously one of us has it wrong. Chris On 20/05/2025 8:58 am, Daniel Kirslis via Election-Methods wrote: > Hi Chris, > > Yes, that is correct. I have created a simplified version of the paper > that attempts to explain the method in the most concise possible way. > It's only two pages: > https://drive.google.com/file/d/1F_I2ZBUKXKbmcS-uSvMAf_gNdNO8m0GB/view?usp=drive_link > > It skips over a lot of the background that explains why I view this as > a compromise between the Borda count and Condorcet methods and just > focuses on explaining the method itself. Once you see how the plotting > works, it is like Bocce Ball - closest to the target ball wins. > > Thank you for your engagement on this. I should have started with this > version of the paper! > > On Mon, May 19, 2025 at 12:32 PM Chris Benham via Election-Methods > <election-methods@lists.electorama.com> wrote: > >> >> It seems like the short version is that the winner is the >> candidate with the smallest sum of SQUARES of non-victories >> (defeats plus ties) against their opponents. > > I take that these numbers you are squaring are the candidate's > opposing and tying vote scores, and not simply the number of such > results. Is that right? > > Because otherwise that would often be very indecisive, like Copeland. > > > On 19/05/2025 1:40 am, Andrew B Jennings (elections) via > Election-Methods wrote: >> Hi Dan, >> >> Great paper. Thank you for posting! >> >> It seems like the short version is that the winner is the >> candidate with the smallest sum of SQUARES of non-victories >> (defeats plus ties) against their opponents. >> >> Taking the square root and dividing can make it meaningful by >> scaling it to [0,1] or [0,s] (where s is the number of voters), >> but doesn't change the finish order. >> >> It does seem like an interesting attempt to "square the circle" >> (great pun) and compromise between Borda and Condorcet. I hadn't >> realized that Borda and Minimax are minimizing the one-norm and >> infinity-norm in the same geometric space. The two-norm certainly >> seems like it should be explored. >> >> I would love to see the proof of non-favorite-betrayal. >> >> Best, >> >> ~ Andy >> On Thursday, May 15th, 2025 at 4:25 PM, Daniel Kirslis via >> Election-Methods <election-methods@lists.electorama.com> >> <mailto:election-methods@lists.electorama.com> wrote: >>> Hello! >>> >>> I am a newcomer to this mailing list, so please forgive me if >>> this message violates any norms or protocols that the members of >>> this list adhere to. >>> >>> I have recently developed a novel method for tabulating >>> ranked-choice elections that attempts to reconcile the concerns >>> of Borda and Condorcet. I believe that it maintains the >>> simplicity and mathematical elegance of the Borda count while >>> incorporating Condorcet's concern with pairwise dominance. >>> Intuitively, it can be understood as ordering candidates by how >>> close they come to being unanimously selected when plotted in >>> Cartesian coordinate space. Here is a link to the paper: >>> https://drive.google.com/file/d/152eNheS2qkLHJbDvG4EwW3jdO4I_NwcX/view?usp=sharing >>> >>> Given its simplicity, I have been very surprised to discover >>> that this method has never been proposed before. I am hoping >>> that some of you all will take a look at the paper and share >>> your comments, questions, and critiques. Ultimately, it is my >>> hope that ranked-choice voting advocates can arrive at a >>> consensus about the best method for RCV and thus strengthen >>> efforts to adopt it and deliver much needed democratic >>> improvements. But even if you don't find the system itself >>> compelling, you may find the method of plotting electoral >>> outcomes elucidated in the paper to be useful for the analysis >>> of other electoral systems. >>> >>> Thank you! >>> >>> -Dan >> >> >> ---- >> Election-Methods mailing list - seehttps://electorama.com/em for list info > ---- > Election-Methods mailing list - see https://electorama.com/em for > list info > > > ---- > Election-Methods mailing list - seehttps://electorama.com/em for list info