In terms of explaining the result, I think Schulze is much better. You can do that very compactly and with only simple, understandable steps. The best I can see doing with RP is more time-consuming and the steps have potential to be more complicated.
As far as promotion is concerned, I haven't run into it; since it's so similar to RP, I think non-algorithmic factors like I mentioned above begin to be more important.
~~~~
The page you linked there has some undefined terms like u/a (it says it's defined in previous articles, but I don't see a link).
>it certainly doesn’t prevent Beatpath (and other TUC methods) from being a strategic mess, without known strategy,
Isn't that a… good thing? With the fog of reality, strategy looking like 60% stabbing yourself, 30% accomplishing nothing, 10% getting what you want… how is that a bad trait for a system to have?
In particular, as far as strategic messes are concerned, I would definitely feel more pressure to use strategy of equivocation in SICT than in beatpath (Schulze), because it would feel a lot less drastic/scary/risky.
What are the improved Condorcet methods you're thinking of? I do recall seeing that Ranked Pairs and Schulze have very favorable strategy-backfire to strategy-works ratios in simulations, but I don't know what you're thinking of for sure. If those are it, then if you approach it right, Schulze isn't that hard to work through and demonstrate an election result (wikipedia now has an example).
95% of the sperm reaching the endpoint, then, if they're not independent.
And, like with sperm, it may be that there were many more insects than needed to fulfill their role? Like, if 20 sperm reach an egg, you can lose 95% of them and end up just as pregnant.
That dialog reminds me of some scenes from Friendship is Optimal, only even more morally off-kilter than CelestAI, which is saying something.
I have no RSS monkeying going on, and Wei Dai and Kaj Sotala have the same font size as you or me.
Instructions unclear, comment stuck in ceiling fan?
That does not always produce a reduced fraction, of course. In order to do that, you need to go find a GCF just like before... but I agree, that should be presented as an *optimization* after teaching the basic idea.
Where is that second quote from? I can't find it here.
I see. I figured U/A meant something like that. I think it's potentially useful to consider that case, but I wouldn't design a system entirely around it.