March 2024 Archives by subject

• Messages sorted by: [ thread ] [ author ] [ date ]
• More info on this list...

Starting: Fri Mar 1 02:02:39 PST 2024
Ending: Sun Mar 31 17:07:24 PDT 2024
Messages: 216

• [EM] apportionment   Richard Lung
• [EM] Appreciation for KM.   robert bristow-johnson
• [EM] Appreciation for KM.   Kristofer Munsterhjelm
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   Michael Ossipoff
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   robert bristow-johnson
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   Michael Ossipoff
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   Closed Limelike Curves
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   robert bristow-johnson
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   Michael Ossipoff
• [EM] Approval & 1-Person-1-Vote, & other Approval reply-answers.   Michael Ossipoff
• [EM] Approval vs Condorcet   Michael Ossipoff
• [EM] Approval vs Condorcet   robert bristow-johnson
• [EM] Approval vs Condorcet   Closed Limelike Curves
• [EM] Approval vs Condorcet   robert bristow-johnson
• [EM] A PR-STV calculator   Kevin Venzke
• [EM] A PR-STV calculator   Richard Lung
• [EM] A PR-STV calculator   Kevin Venzke
• [EM] A PR-STV calculator   Richard Lung
• [EM] Characterization of some voting-systems & their results   Michael Ossipoff
• [EM] Characterization of some voting-systems & their results   Michael Ossipoff
• [EM] Characterization of some voting-systems & their results   Michael Ossipoff
• [EM] Characterization of some voting-systems & their results   Michael Garman
• [EM] Characterization of some voting-systems & their results   Closed Limelike Curves
• [EM] Clean IRV election data   Closed Limelike Curves
• [EM] Clean IRV election data   Greg Dennis
• [EM] Clean IRV election data   Joshua Boehme
• [EM] Continuing interrupted reply to Closed   Michael Ossipoff
• [EM] Continuing interrupted reply to Closed   Richard Lung
• [EM] Countering FairVote propaganda on Wikipedia   Closed Limelike Curves
• [EM] Countering FairVote propaganda on Wikipedia   robert bristow-johnson
• [EM] Countering FairVote propaganda on Wikipedia   Michael Ossipoff
• [EM] Countering FairVote propaganda on Wikipedia   Kristofer Munsterhjelm
• [EM] Countering FairVote propaganda on Wikipedia   Kristofer Munsterhjelm
• [EM] Countering FairVote propaganda on Wikipedia   Closed Limelike Curves
• [EM] Countering FairVote propaganda on Wikipedia   Kristofer Munsterhjelm
• [EM] Easy River definition (also my site is back up)   Kevin Venzke
• [EM] Easy River definition (also my site is back up)   Michael Ossipoff
• [EM] Easy River definition (also my site is back up)   Closed Limelike Curves
• [EM] Easy River definition (also my site is back up)   Kevin Venzke
• [EM] Easy River definition (also my site is back up)   Michael Ossipoff
• [EM] Easy River definition (also my site is back up)   Kristofer Munsterhjelm
• [EM] Easy River definition (also my site is back up)   Ted Stern
• [EM] Electing Cabinets, starting by using MJ: Election-Methods Digest, Vol 236, Issue 18   steve bosworth
• [EM] Electing Cabinets/Executive Committees   Closed Limelike Curves
• [EM] Electing Cabinets/Executive Committees   Kristofer Munsterhjelm
• [EM] Electing Cabinets/Executive Committees   Closed Limelike Curves
• [EM] Electing Cabinets/Executive Committees   Closed Limelike Curves
• [EM] Electing Cabinets/Executive Committees   Ted Stern
• [EM] Electing Cabinets/Executive Committees   Richard, the VoteFair guy
• [EM] Electing Cabinets/Executive Committees   Richard Lung
• [EM] Election-Methods Digest, Vol 236, Issue 12   steve bosworth
• [EM] Election-Methods Digest, Vol 236, Issue 12   Closed Limelike Curves
• [EM] Election-Methods Digest, Vol 236, Issue 12   Closed Limelike Curves
• [EM] Election-Methods Digest, Vol 236, Issue 12   Ted Stern
• [EM] Election-Methods Digest, Vol 236, Issue 18   steve bosworth
• [EM] Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Election-Methods Digest, Vol 236, Issue 18   robert bristow-johnson
• [EM] Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Election-Methods Digest, Vol 236, Issue 18   robert bristow-johnson
• [EM] Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Endorsement for STAR voting   Rob Lanphier
• [EM] Endorsement for STAR voting   robert bristow-johnson
• [EM] Endorsement for STAR voting   Rob Lanphier
• [EM] Endorsement for STAR voting   Kristofer Munsterhjelm
• [EM] Endorsement for STAR voting   Closed Limelike Curves
• [EM] Endorsement for STAR voting   Michael Ossipoff
• [EM] Endorsement for STAR voting   Michael Ossipoff
• [EM] Endorsement for STAR voting   Kristofer Munsterhjelm
• [EM] Endorsement for STAR voting   Toby Pereira
• [EM] Endorsement for STAR voting   Closed Limelike Curves
• [EM] Finding Condorcet   robert bristow-johnson
• [EM] Finding Condorcet   Closed Limelike Curves
• [EM] Finding Condorcet   Kristofer Munsterhjelm
• [EM] Finding Condorcet   Kristofer Munsterhjelm
• [EM] Finding Condorcet   Closed Limelike Curves
• [EM] Finding the center-most voters. A toy/experiment   Kevin Venzke
• [EM] freedom and determinism   Richard Lung
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   robert bristow-johnson
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   robert bristow-johnson
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   robert bristow-johnson
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Closed Limelike Curves
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Ossipoff
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   Toby Pereira
• [EM] Fwd: Election-Methods Digest, Vol 236, Issue 18   robert bristow-johnson
• [EM] Fwd: Fwd: Election-Methods Digest, Vol 236, Issue 18   Michael Garman
• [EM] Fwd: No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] IRV/FPP equivalence theorem?   Closed Limelike Curves
• [EM] Needless voting disappointments. Election-Methods Digest, Vol 236, Issue 43   steve bosworth
• [EM] Needless voting disappointments. Election-Methods Digest, Vol 236, Issue 43   Richard Lung
• [EM] New Thread: Needless voting disappointments   steve bosworth
• [EM] New Thread: Needless voting disappointments   Richard Lung
• [EM] New Thread: Needless voting disappointments   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Rob Lanphier
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Toby Pereira
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Toby Pereira
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   robert bristow-johnson
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Ossipoff
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Michael Garman
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Richard Lung
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Richard Lung
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Closed Limelike Curves
• [EM] No. Condorcet and Hare do not share the same problem with computational complexity and process transparency.   Kristofer Munsterhjelm
• [EM] Part 2, Approval vs Condorcet   Michael Ossipoff
• [EM] Part 2, Approval vs Condorcet   Toby Pereira
• [EM] Part 2, Approval vs Condorcet   Michael Ossipoff
• [EM] Part 3 of Approval vs Condorcet   Michael Ossipoff
• [EM] Part 3 of Approval vs Condorcet   Michael Garman
• [EM] Part 3 of Approval vs Condorcet   Michael Garman
• [EM] Part 3 of Approval vs Condorcet   Michael Ossipoff
• [EM] Part 3 of Approval vs Condorcet   Michael Ossipoff
• [EM] Part 3 of Approval vs Condorcet   Kristofer Munsterhjelm
• [EM] Part 3 of Approval vs Condorcet   Michael Garman
• [EM] Part 3 of Approval vs Condorcet   Michael Ossipoff
• [EM] Possible resistant set cloneproofing template   Kristofer Munsterhjelm
• [EM] Question to the Condorcetists   Toby Pereira
• [EM] Question to the Condorcetists   Steve Eppley
• [EM] Question to the Condorcetists   Toby Pereira
• [EM] Question to the Condorcetists   Toby Pereira
• [EM] Question to the Condorcetists   Toby Pereira
• [EM] Question to the Condorcetists   Closed Limelike Curves
• [EM] Question to the Condorcetists   Michael Ossipoff
• [EM] Question to the Condorcetists   Closed Limelike Curves
• [EM] Question to the Condorcetists   Closed Limelike Curves
• [EM] Question to the Condorcetists   robert bristow-johnson
• [EM] Question to the Condorcetists   Michael Ossipoff
• [EM] Question to the Condorcetists   Closed Limelike Curves
• [EM] Question to the Condorcetists   Michael Ossipoff
• [EM] Resistant set: exploring it, and why three candidate monotonicity is easy   Kristofer Munsterhjelm
• [EM] Resistant set: three almost monotone methods, with stats, and Landau surprise   Kristofer Munsterhjelm
• [EM] Successful third parties   KenB
• [EM] Successful third parties   robert bristow-johnson
• [EM] Successful third parties   KenB
• [EM] Successful third parties   robert bristow-johnson
• [EM] Successful third parties   KenB
• [EM] The Frequency of Condorcet Winners in Real Non-Political Elections   Andrew Myers
• [EM] This is a repost for the benefit of Mr. Garman of RankTheVote   robert bristow-johnson
• [EM] This is a repost for the benefit of Mr. Garman of RankTheVote   Michael Garman
• [EM] This is a repost for the benefit of Mr. Garman of RankTheVote   robert bristow-johnson
• [EM] This is a repost for the benefit of Mr. Garman of RankTheVote   Closed Limelike Curves

Last message date: Sun Mar 31 17:07:24 PDT 2024
Archived on: Sun Apr 14 19:26:30 PDT 2024

• Messages sorted by: [ thread ] [ author ] [ date ]
• More info on this list...