About: Kemeny–Young method

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Kemeny–Young method Goto Sponge NotDistinct Permalink

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

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FKemeny%E2%80%93Young_method

The Kemeny–Young method is an electoral system that uses preferential ballots and pairwise comparison counts to identify the most popular choices in an election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice. The Kemeny–Young method is also known as the Kemeny rule, VoteFair popularity ranking, the maximum likelihood method, and the median relation.

Attributes	Values
rdf:type	yago:WikicatMonotonicCondorcetMethods yago:WikicatVotingSystems yago:Ability105616246 yago:Abstraction100002137 yago:Cognition100023271 yago:Content105809192 yago:Idea105833840 yago:Know-how105616786 yago:LegalSystem105903229 yago:Method105660268 yago:Plan105898568 yago:PlanOfAction105902545 yago:PsychologicalFeature100023100 yago:System105902872 yago:VotingSystem105904135 yago:WikicatElectoralSystems
rdfs:label	Kemeny–Young method (en)
rdfs:comment	The Kemeny–Young method is an electoral system that uses preferential ballots and pairwise comparison counts to identify the most popular choices in an election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice. The Kemeny–Young method is also known as the Kemeny rule, VoteFair popularity ranking, the maximum likelihood method, and the median relation. (en)
dcterms:subject	Electoral systems Monotonic Condorcet methods
Wikipage page ID	5339275 (xsd:integer)
Wikipage revision ID	1097461520 (xsd:integer)
Link from a Wikipage to another Wikipage	Electoral system Numerical Recipes Monotonicity criterion Participation criterion Tournament graph Peyton Young Independence of Smith-dominated alternatives Independence of clones criterion Independence of irrelevant alternatives Instant-runoff voting Integer programming Library (computing) Condorcet criterion Condorcet method Schwartz set Epistemology NP-hard Condorcet's jury theorem Consistency criterion Feedback arc set Majority criterion Bubble sort Electoral systems Total order Held–Karp algorithm Later-no-harm criterion Reversal symmetry Non-dictatorship PHP Kendall tau distance Pairwise comparison Arrow's impossibility theorem John George Kemeny Monotonic Condorcet methods Tactical voting Marquis de Condorcet Polynomial-time approximation scheme Polynomial time Maximum likelihood estimator Maximum likelihood Unrestricted domain Pareto efficiency Smith set Ranked voting First-past-the-post voting Smith criterion Condorcet winner Preferential ballot
Link from a Wikipage to an external page	http://vene.ro/blog/kemeny-young-optimal-rank-aggregation-in-python.html http://www.numerical.recipes/whp/ky/kemenyyoung.html https://ewanchelley.github.io/voting/kemeny http://www.VoteFair.org https://github.com/julien-boudry/Condorcet_Schulze-PHP_Class https://github.com/wbreeze/davenport https://github.com/wbreeze/davenport-ruby https://github.com/cpsolver/VoteFair-ranking-cpp
sameAs	Kemeny–Young method Kemeny–Young method Kemeny–Young method
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Clarify dbt:Reflist dbt:Short_description dbt:Sqrt dbt:Voting_systems dbt:Electoral_systems dbt:Tenn_voting_example dbt:Comparison_of_Schulze_to_preferential_voting_systems
has abstract	The Kemeny–Young method is an electoral system that uses preferential ballots and pairwise comparison counts to identify the most popular choices in an election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice. This method assigns a score for each possible sequence, where each sequence considers which choice might be most popular, which choice might be second-most popular, which choice might be third-most popular, and so on down to which choice might be least-popular. The sequence that has the highest score is the winning sequence, and the first choice in the winning sequence is the most popular choice. (As explained below, ties can occur at any ranking level.) The Kemeny–Young method is also known as the Kemeny rule, VoteFair popularity ranking, the maximum likelihood method, and the median relation. (en)
gold:hypernym	System
prov:wasDerivedFrom	wikipedia-en:Kemeny–Young_method?oldid=1097461520&ns=0
page length (characters) of wiki page	28610 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Kemeny–Young_method
is Link from a Wikipage to another Wikipage of	Electoral system List of electoral systems Peyton Young Independence of clones criterion Independence of irrelevant alternatives

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software