Overview... the count is based on the pairwise support matrix.
At any stage of the election each candidate belongs to a team, and one member of each team is its captain.
To start with there are many teams... because initially each team has only one member .. its captain.
As the "count" progresses some teams are absorbed (one at a time) by others until in the end there is only one big team which has gobbled up all of the others.
When one team absorbs another the team captain of the absorbing team is retained as captain of the new, merged team, while the captain of the absorbed team becomes an ordinary member of the merger without any special distinction.
The captain of the final merger is elected.
So at any given stage, how do we determine which team gets absorbed by which other team?
The strongest pairwise victory of a member (possibly captain) of one team over the captain of another determines the answer to this question.
The team of the defeated captain is absorbed by the team of the victorious member.
This method is equivalent to a fairly well known method by another name. Anybody recognize it?
Sent from my MetroPCS 4G LTE Android Device
Did anybody recognize Teams as a reformulation of River?
It shows that it is not necessary to explicify the implicit tree structure induced by the successive engulfing of one team by another.
Does this simplified formulation increase River's chances of public adoption?
Sent from my MetroPCS 4G LTE Android Device
-------- Original message --------
From: Susan Simmons suzerainsimmons@outlook.com
Date: 7/8/21 8:25 PM (GMT-08:00)
To: election-methods@lists.electorama.com
Subject: Teams
Overview... the count is based on the pairwise support matrix.
At any stage of the election each candidate belongs to a team, and one member of each team is its captain.
To start with there are many teams... because initially each team has only one member .. its captain.
As the "count" progresses some teams are absorbed (one at a time) by others until in the end there is only one big team which has gobbled up all of the others.
When one team absorbs another the team captain of the absorbing team is retained as captain of the new, merged team, while the captain of the absorbed team becomes an ordinary member of the merger without any special distinction.
The captain of the final merger is elected.
So at any given stage, how do we determine which team gets absorbed by which other team?
The strongest pairwise victory of a member (possibly captain) of one team over the captain of another determines the answer to this question.
The team of the defeated captain is absorbed by the team of the victorious member.
This method is equivalent to a fairly well known method by another name. Anybody recognize it?
Sent from my MetroPCS 4G LTE Android Device
On Fri, Jul 9, 2021 at 4:27 PM Susan Simmons suzerainsimmons@outlook.com
wrote:
Did anybody recognize Teams as a reformulation of River?
It shows that it is not necessary to explicify the implicit tree structure
induced by the successive engulfing of one team by another.
Does this simplified formulation increase River's chances of public
adoption?
It took me some effort to understand the Teams method, but maybe I'm not a
good test. I'm only a little smarter than your average koala ;-) But let
me offer a different way to write the Teams / River method that might be a
little easier to follow. Among other things, I removed the sports analogy,
moved some of the core concepts higher up, and inserted some redundancy.
Let me know what you think:
Overview... the count is based on the pairwise support matrix.
The winner is elected via a series of rounds in which candidates are merged
into groups, where each group has a unique head. The first round begins
with every candidate being the sole member of a one-member group. Each
round consists of two steps:
Identify two groups to merge. Find the group “A” for which the head of
the group has the greatest pairwise loss against any member of another
group.
Group “A” is merged into the group of the pairwise winner from step (1)
and the previous head of group “A” is no longer the head of any group.
Cheers,
Daniel
On 07/09/2021 5:27 PM Susan Simmons suzerainsimmons@outlook.com wrote:
Does this simplified formulation increase River's chances of public adoption?
I am neither a lawyer nor a legislator, but I have once "written" legislation that had been adopted into law (by drawing a map) and have reviewed a bunch of RCV legislations.
To get a method adopted into law, you will need to break it down into a deterministic procedure with explicit steps involving well-defined objects: like Candidates, Ballots, Ranking levels (higher or lower), and Counting ballots based on determining some well-defined Conditions.
Candidates will be assigned Status based on the Counting and Conditions spelled out in the definitions. Off-hand, the status is 1. Elected, 2. Potentially elected (or "Continuing"), and 3. Defeated (or eliminated).
STV has an object called a Single Transferable Vote. I call that object a "Vote token" but I didn't need the word "token" in the legal language.
In BTR-STV I did have to create a candidate status that I called "Greater Voter Support" and "Lesser Voter Support".
As the "count" progresses some teams are absorbed (one at a time) by others until in the end there is only one big team which has gobbled up all of the others.
So you need to define which team gets absorbed with which other team. I cannot be an implicit definition. And you have to define what being "absorbed" is. Perhaps "set union" or "combined" might be a better word.
By "pairwise support matrix" do you mean that N by N matrix used to determine the Condorcet candidate? And how is "strongest pairwise victory" is defined?
--
r b-j . _ . _ . _ . _ rbj@audioimagination.com
"Imagination is more important than knowledge."
.
.
.
Very Good! You are a technical writing genius!
A selling point ... it works by unification (amalgamation), not mere elimination. Members of the absorbed group (that would have been summarily discarded by a less provident method) may continue to inform the outcome or, in other words, contribute to the democratic strength of the group.
Sent from my MetroPCS 4G LTE Android Device
-------- Original message --------
From: Daniel Carrera dcarrera@gmail.com
Date: 7/9/21 4:41 PM (GMT-08:00)
To: Susan Simmons suzerainsimmons@outlook.com
Cc: election-methods@lists.electorama.com
Subject: Re: [EM] Teams
On Fri, Jul 9, 2021 at 4:27 PM Susan Simmons <suzerainsimmons@outlook.commailto:suzerainsimmons@outlook.com> wrote:
Did anybody recognize Teams as a reformulation of River?
It shows that it is not necessary to explicify the implicit tree structure induced by the successive engulfing of one team by another.
Does this simplified formulation increase River's chances of public adoption?
It took me some effort to understand the Teams method, but maybe I'm not a good test. I'm only a little smarter than your average koala ;-) But let me offer a different way to write the Teams / River method that might be a little easier to follow. Among other things, I removed the sports analogy, moved some of the core concepts higher up, and inserted some redundancy. Let me know what you think:
Overview... the count is based on the pairwise support matrix.
The winner is elected via a series of rounds in which candidates are merged into groups, where each group has a unique head. The first round begins with every candidate being the sole member of a one-member group. Each round consists of two steps:
Identify two groups to merge. Find the group “A” for which the head of the group has the greatest pairwise loss against any member of another group.
Group “A” is merged into the group of the pairwise winner from step (1) and the previous head of group “A” is no longer the head of any group.
Cheers,
Daniel
Daniel,
Let's take adavantage of Robert Bristow-Johnson's valuable experience when we approach the tricky business of writing and submitting legal language for a ballot initiative.
The definition of the method, as I envision it, will be a technical elaboration of your core description, while in turn the voter pamphlet explanation to the average voter will be a user friendly elaboration of the same, complete with faq's, etc.
It would be great if somebody with the time, energy, and vision could start a website....
????.com
to spread the word, test the waters, etc.
We need a really good name with a good acronymn ... ????
Jobst (inventor of River) is super busy, but nobody is more astute in this arena.
Sent from my MetroPCS 4G LTE Android Device
-------- Original message --------
From: Daniel Carrera dcarrera@gmail.com
Date: 7/9/21 4:41 PM (GMT-08:00)
To: Susan Simmons suzerainsimmons@outlook.com
Cc: election-methods@lists.electorama.com
Subject: Re: [EM] Teams
On Fri, Jul 9, 2021 at 4:27 PM Susan Simmons <suzerainsimmons@outlook.commailto:suzerainsimmons@outlook.com> wrote:
Did anybody recognize Teams as a reformulation of River?
It shows that it is not necessary to explicify the implicit tree structure induced by the successive engulfing of one team by another.
Does this simplified formulation increase River's chances of public adoption?
It took me some effort to understand the Teams method, but maybe I'm not a good test. I'm only a little smarter than your average koala ;-) But let me offer a different way to write the Teams / River method that might be a little easier to follow. Among other things, I removed the sports analogy, moved some of the core concepts higher up, and inserted some redundancy. Let me know what you think:
Overview... the count is based on the pairwise support matrix.
The winner is elected via a series of rounds in which candidates are merged into groups, where each group has a unique head. The first round begins with every candidate being the sole member of a one-member group. Each round consists of two steps:
Identify two groups to merge. Find the group “A” for which the head of the group has the greatest pairwise loss against any member of another group.
Group “A” is merged into the group of the pairwise winner from step (1) and the previous head of group “A” is no longer the head of any group.
Cheers,
Daniel
On 07/09/2021 9:56 PM Susan Simmons suzerainsimmons@outlook.com wrote:
Daniel,
Let's take adavantage of Robert Bristow-Johnson's valuable experience when we approach the tricky business of writing and submitting legal language for a ballot initiative.
i may have posted this before. here is the IRV language i used as a template to start with:
All elections of [office] shall be by ballot, using a system of ranked-choice voting without a separate runoff election. The presiding election officer shall implement a ranked-choice voting protocol according to these guidelines:
(1) The ballot shall give voters the option of ranking candidates in order of preference. Lower ordinal preference shall be considered higher rank and the candidate marked as first preference is considered ranked highest. Equal ranking of candidates shall not be allowed. Any candidate not marked with a preference shall be considered as ranked lower than every candidate marked with a preference.
(2) If a candidate receives a majority (over 50 percent of all ballots) of first preferences, that candidate is elected.
(3) If no candidate receives a majority of first preferences, an instant runoff retabulation shall be performed by the presiding election officer. The instant runoff retabulation shall be conducted in sequential rounds. A "continuing candidate" is defined as a candidate that has not been defeated in any previous round. Initially, no candidate is defeated and all candidates begin as continuing candidates.
(4) In each round, every ballot shall count as a single vote for whichever continuing candidate the voter has ranked highest. The candidate with fewest votes is defeated in the current round.
(5) The aforementioned instant runoff retabulation, eliminating one candidate each round, shall be repeated until only two candidates remain. The remaining candidate then receiving the greatest number of votes is elected.
(6) The [governing jurisdiction] may adopt additional regulations consistent with this subsection to implement these standards.
here is how i modified it for BTR-STV:
All elections of [office] shall be by ballot, using a system of ranked-choice voting without a separate runoff election. The presiding election officer shall implement a ranked-choice voting protocol according to these guidelines:
(1) The ballot shall give voters the option of ranking candidates in order of preference. Lower ordinal preference shall be considered higher rank and the candidate marked as first preference is considered ranked highest. Equal ranking of candidates shall not be allowed. Any candidate not marked with a preference shall be considered as ranked lower than every candidate marked with a preference.
(2) If a candidate receives a majority (over 50 percent of all ballots) of first preferences, that candidate is elected.
(3) If no candidate receives a majority of first preferences, an instant runoff retabulation shall be performed by the presiding election officer. The instant runoff retabulation shall be conducted in sequential rounds. A "continuing candidate" is defined as a candidate that has not been defeated in any previous round. Initially, no candidate is defeated and all candidates begin as continuing candidates.
(4) In each round, every ballot shall count as a single vote for whichever continuing candidate the voter has ranked highest. The two candidates with the fewest votes in a round, herein denoted as "A" and "B", shall contend in a runoff in which the candidate, A or B, with lesser voter support shall be defeated in the current round. If the number of ballots ranking A higher than B exceeds the number of ballots ranking B higher than A, then B has lesser voter support, B is defeated, and A continues to the following round. Likewise, if the number of ballots ranking B higher than A exceeds the number of ballots ranking A higher than B, then A has lesser voter support, A is defeated, and B continues to the following round. In the case that the aforementioned measures of voter support of A and B are tied, then the candidate with fewest votes is defeated in the current round.
(5) The aforementioned instant runoff retabulation, eliminating one candidate each round, shall be repeated until only two candidates remain. The remaining candidate then receiving the greatest number of votes is elected.
(6) The [governing jurisdiction] may adopt additional regulations consistent with this subsection to implement these standards.
and, when i was having a discussion with Eric Maskin, we wanted to compare language to what he called "ordinary Condorcet", it's just a speculative guess by me (but the problem is there is no resolution to a cycle):
All elections of [office] shall be by ballot, using a system of ranked-choice voting without a separate runoff election. The presiding election officer shall implement a ranked-choice voting protocol according to these guidelines:
(1) The ballot shall give voters the option of ranking candidates in order of preference. Lower ordinal preference shall be considered higher rank and the candidate marked as first preference is considered ranked highest. Equal ranking of candidates shall be allowed. Any candidate not marked with a preference shall be considered as ranked lower than every candidate marked with a preference.
(2) If a candidate receives a majority (over 50 percent of all ballots) of first preferences, that candidate is elected.
(3) If no candidate receives a majority of first preferences, a Condorcet-compliant retabulation shall be performed by the presiding election officer. The candidate who is the Condorcet winner is elected, if the rankings on all of the ballots indicate that this one candidate defeats, by a simple majority of voter preferences, all other candidates when compared in turn with each other individual candidate. A selected candidate defeats another candidate by a simple majority when the number of ballots ranking the selected candidate higher than the other candidate exceeds the number of ballots marked to the contrary.
(4) The [governing jurisdiction] may adopt additional regulations consistent with this subsection to implement these standards.
I'm just thinking that the language may have to look something like that,
--
r b-j . _ . _ . _ . _ rbj@audioimagination.com
"Imagination is more important than knowledge."
.
.
.
Susan,
On Fri, Jul 9, 2021 at 8:56 PM Susan Simmons suzerainsimmons@outlook.com
wrote:
Daniel,
Let's take adavantage of Robert Bristow-Johnson's valuable experience when
we approach the tricky business of writing and submitting legal language
for a ballot initiative.
I think I found a slightly simpler formulation of River. It's based on your
"Teams" algorithm but I think strictly speaking we can do without an
explicit mention of teams or groups:
You can see that I'm following RB-J's guidance of using explicit labels for
well-defined objects. Can you confirm that what I wrote above will produce
the same winner as River? If so, then here is my attempt to write the above
method into legalese similar to the examples provided by RB-J:
While this is a hair longer than I would prefer (217 words) I am reluctant
to remove the redundancy.
The definition of the method, as I envision it, will be a technical
elaboration of your core description, while in turn the voter pamphlet
explanation to the average voter will be a user friendly elaboration of the
same, complete with faq's, etc.
It would be great if somebody with the time, energy, and vision could
start a website....
I am not the best person to lead this. Among other things, I am not a US
citizen and it might be a bit weird if a foreigner is trying to mess around
with the way an American city elects its leaders. But I could play a
supporting role.
????.com
...
We need a really good name with a good acronymn ... ????
rankedvoting.org
MMV = Maximum Majority Voting
MME = Maximum Majority Election
RHV = Ranked Head-to-Head voting
AVC voting = All Voters Count voting
ABC voting = All Ballots Count voting
EVC voting = Every Vote Counts
CEV = Count Every vote
... DDV = Demolition Derby Voting ?
Cheers,
Daniel
The separate groups, teams, river basins exist to keep the snake from eating its tail ... that's why we consider only contests between the head of one group and the members of another (different) group. If the head is defeated by a member of its own group, then we essentially lock in a cycle.
This doesn't need to be mentioned in the definition, but definitely included in the faq's, etc.
The most natural place it comes up is in the recursive proof that every head (including the final one) has a beat path to each member of its group.
BTW the fact that the final head has a beat path to every member of its group (i.e. to all of the other candidates) shows that the winner is in the Smith set.
Sent from my MetroPCS 4G LTE Android Device
-------- Original message --------
From: Daniel Carrera dcarrera@gmail.com
Date: 7/9/21 11:30 PM (GMT-08:00)
To: Susan Simmons suzerainsimmons@outlook.com
Cc: election-methods@lists.electorama.com
Subject: Re: [EM] Teams
Susan,
On Fri, Jul 9, 2021 at 8:56 PM Susan Simmons <suzerainsimmons@outlook.commailto:suzerainsimmons@outlook.com> wrote:
Daniel,
Let's take adavantage of Robert Bristow-Johnson's valuable experience when we approach the tricky business of writing and submitting legal language for a ballot initiative.
I think I found a slightly simpler formulation of River. It's based on your "Teams" algorithm but I think strictly speaking we can do without an explicit mention of teams or groups:
You can see that I'm following RB-J's guidance of using explicit labels for well-defined objects. Can you confirm that what I wrote above will produce the same winner as River? If so, then here is my attempt to write the above method into legalese similar to the examples provided by RB-J:
While this is a hair longer than I would prefer (217 words) I am reluctant to remove the redundancy.
The definition of the method, as I envision it, will be a technical elaboration of your core description, while in turn the voter pamphlet explanation to the average voter will be a user friendly elaboration of the same, complete with faq's, etc.
It would be great if somebody with the time, energy, and vision could start a website....
I am not the best person to lead this. Among other things, I am not a US citizen and it might be a bit weird if a foreigner is trying to mess around with the way an American city elects its leaders. But I could play a supporting role.
????.com
...
We need a really good name with a good acronymn ... ????
rankedvoting.orghttp://rankedvoting.org
MMV = Maximum Majority Voting
MME = Maximum Majority Election
RHV = Ranked Head-to-Head voting
AVC voting = All Voters Count voting
ABC voting = All Ballots Count voting
EVC voting = Every Vote Counts
CEV = Count Every vote
... DDV = Demolition Derby Voting ?
Cheers,
Daniel
On 7/10/21 9:23 AM, Susan Simmons wrote:
The separate groups, teams, river basins exist to keep the snake from
eating its tail ... that's why we consider only contests between the
head of one group and the members of another (different) group. If the
head is defeated by a member of its own group, then we essentially lock
in a cycle.
This doesn't need to be mentioned in the definition, but definitely
included in the faq's, etc.
The most natural place it comes up is in the recursive proof that every
head (including the final one) has a beat path to each member of its group.
BTW the fact that the final head has a beat path to every member of its
group (i.e. to all of the other candidates) shows that the winner is in
the Smith set.
Is there a way of extending River to producing a full social order in a
way that passes LIIA? If so, it'd seem to be strictly better than Ranked
Pairs because River also passes IPDA.
Well, perhaps River fails MAM's immunity to complaints criterion, but
that's rather specific.
-km