Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6865374> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q6865374 subject Q8408918.
- Q6865374 subject Q8639205.
- Q6865374 abstract "In voting systems, the Minimax method is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is also known as the Simpson-Kramer method, and the successive reversal method.Minimax selects as the winner the candidate whose greatest pairwise defeat is smaller than the greatest pairwise defeat of any other candidate.".
- Q6865374 wikiPageExternalLink Minmax.
- Q6865374 wikiPageExternalLink desc.html.
- Q6865374 wikiPageExternalLink Condorcet_Schulze-PHP_Class.
- Q6865374 wikiPageWikiLink Q1052894.
- Q6865374 wikiPageWikiLink Q1078003.
- Q6865374 wikiPageWikiLink Q182985.
- Q6865374 wikiPageWikiLink Q188860.
- Q6865374 wikiPageWikiLink Q4241323.
- Q6865374 wikiPageWikiLink Q5159350.
- Q6865374 wikiPageWikiLink Q59.
- Q6865374 wikiPageWikiLink Q6016274.
- Q6865374 wikiPageWikiLink Q6495513.
- Q6865374 wikiPageWikiLink Q6738428.
- Q6865374 wikiPageWikiLink Q6944195.
- Q6865374 wikiPageWikiLink Q7205546.
- Q6865374 wikiPageWikiLink Q751319.
- Q6865374 wikiPageWikiLink Q7545395.
- Q6865374 wikiPageWikiLink Q831304.
- Q6865374 wikiPageWikiLink Q8408918.
- Q6865374 wikiPageWikiLink Q8639205.
- Q6865374 wikiPageWikiLink Q868720.
- Q6865374 comment "In voting systems, the Minimax method is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is also known as the Simpson-Kramer method, and the successive reversal method.Minimax selects as the winner the candidate whose greatest pairwise defeat is smaller than the greatest pairwise defeat of any other candidate.".
- Q6865374 label "Minimax Condorcet".