Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
voting method
|
| gptkbp:alsoKnownAs |
gptkb:Ranked_Pairs
|
| gptkbp:category |
gptkb:Condorcet_method
|
| gptkbp:complexity |
polynomial time
|
| gptkbp:criteria |
gptkb:Condorcet_criterion
monotonicity independence of clones |
| gptkbp:criterionNotSatisfied |
participation criterion
later-no-harm criterion |
| gptkbp:firstPublished |
1987
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tideman method
|
| gptkbp:inventedBy |
gptkb:Nicolaus_Tideman
|
| gptkbp:resolves |
gptkb:Condorcet_paradox
|
| gptkbp:step |
Lock pairs without creating cycles
Sort pairs by strength of victory Winner is source of the graph |
| gptkbp:usedBy |
various organizations and elections
|
| gptkbp:usedFor |
decision making
elections |
| gptkbp:uses |
pairwise comparison
|
| gptkbp:bfsParent |
gptkb:Ranked_Pairs
|
| gptkbp:bfsLayer |
8
|