This HTML5 document contains 57 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
n18https://www.cs.angelo.edu/~rlegrand/rbvote/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n8https://github.com/julien-boudry/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
n13https://electowiki.org/wiki/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Minimax_(disambiguation)
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
dbo:wikiPageDisambiguates
dbr:Minimax_Condorcet_method
Subject Item
dbr:Minimax_Condorcet_method
rdfs:label
Minimax Condorcet method
rdfs:comment
In voting systems, the Minimax Condorcet method (often referred to as "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 sometimes referred to 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: or, put another way, "the only candidate whose support never drops below [N] percent" in any pairwise contest.
dcterms:subject
dbc:Monotonic_Condorcet_methods
dbo:wikiPageID
2236235
dbo:wikiPageRevisionID
1076379174
dbo:wikiPageWikiLink
dbr:Smith_set dbr:Voting_system dbr:Minimax dbr:Multiwinner_voting dbr:Library_(computing) dbr:Plurality_criterion dbr:Condorcet_criterion dbr:Condorcet_method dbr:PHP dbr:Ranked_voting_systems dbr:Wald's_maximin_model dbr:Independence_of_clones_criterion dbr:Independence_of_irrelevant_alternatives dbr:Later-no-harm dbr:Condorcet_loser_criterion dbc:Monotonic_Condorcet_methods dbr:Single-member_district dbr:Ranked_pairs dbr:Schulze_method dbr:Majority_criterion dbr:Mutual_majority_criterion
dbo:wikiPageExternalLink
n8:Condorcet_Schulze-PHP_Class n13:Minmax n18:desc.html
owl:sameAs
wikidata:Q6865374 n14:4s61j dbpedia-fa:کندورسه_کمین‌بیش
dbp:wikiPageUsesTemplate
dbt:Electoral_systems dbt:Short_description dbt:Tenn_voting_example dbt:Citation_needed dbt:Voting_systems
dbo:abstract
In voting systems, the Minimax Condorcet method (often referred to as "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 sometimes referred to 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: or, put another way, "the only candidate whose support never drops below [N] percent" in any pairwise contest.
prov:wasDerivedFrom
wikipedia-en:Minimax_Condorcet_method?oldid=1076379174&ns=0
dbo:wikiPageLength
12694
foaf:isPrimaryTopicOf
wikipedia-en:Minimax_Condorcet_method
Subject Item
dbr:Comparison_of_electoral_systems
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
Subject Item
dbr:Free_State_Project
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
Subject Item
dbr:Copeland's_method
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
Subject Item
dbr:Minimax_Condorcet
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
dbo:wikiPageRedirects
dbr:Minimax_Condorcet_method
Subject Item
dbr:Multiwinner_voting
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
Subject Item
dbr:Smith_set
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
Subject Item
dbr:Minimax_condorcet
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
dbo:wikiPageRedirects
dbr:Minimax_Condorcet_method
Subject Item
dbr:Simpson-Kramer_method
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
dbo:wikiPageRedirects
dbr:Minimax_Condorcet_method
Subject Item
dbr:Simpson–Kramer_method
dbo:wikiPageWikiLink
dbr:Minimax_Condorcet_method
dbo:wikiPageRedirects
dbr:Minimax_Condorcet_method
Subject Item
wikipedia-en:Minimax_Condorcet_method
foaf:primaryTopic
dbr:Minimax_Condorcet_method