Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a232e39c9ed2d434

Jump to content

Talk:Tideman alternative method

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 3 months ago by Quantling in topic Tideman alternative method vs. Smith/IRV

Tideman alternative method vs. Smith/IRV

[edit]

Is it possible that this Tideman alternative method article is instead describing Smith/IRV? The article describes the method where candidates outside the Smith set are eliminated in the first step. If the Smith set has more than one candidate then one of the Smith-set candidates is then eliminated using the criterion from instant runoff. Then the procedure repeats, looking for a Smith Set among the remaining candidates, etc. However, maybe this is what Smith/IRV does.

Instead maybe what the Tideman alternative method does is check for a Condorcet winner and, if it fails to find one, eliminates a single candidate using the criterion from instant runoff. With only one candidate eliminated it then repeats the check for a Condorcet winner, and so on.

Should we describe both algorithms in the present article? Which name goes with which? —Quantling (talk | contribs) 19:17, 9 April 2026 (UTC)Reply