• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Dodgson's method     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatElectoralSystems, within Data Space : dbpedia.org associated with source document(s)

Type: yago:WikicatVotingSystemsyago:WikicatNon-monotonicCondorcetMethodsyago:Ability105616246yago:Abstraction100002137yago:Cognition100023271yago:Content105809192yago:Idea105833840yago:Know-how105616786yago:LegalSystem105903229yago:Method105660268yago:Plan105898568yago:PlanOfAction105902545yago:PsychologicalFeature100023100yago:System105902872yago:VotingSystem105904135yago:WikicatElectoralSystems New Facet based on Instances of this Class

Dodgson's method is an electoral system proposed by the author, mathematician and logician Charles Dodgson, better known as Lewis Carroll. The method is to extend the Condorcet method by swapping candidates until a Condorcet winner is found. The winner is the candidate which requires the minimum number of swaps. Dodgson proposed this voting scheme in his 1876 work "A method of taking votes on more than two issues". Given an integer k and an election, it is NP-complete to determine whether a candidate can become a Condorcet winner with fewer than k swaps.