Condorcet method (original) (raw)
Kondorcet-balotado estas balotsistemo, kiu kongruas kun la Kondorcet-kriterio. Ekzemploj de Kondorcet-balotadoj estas: * * * Paroranga metodo *
| Property | Value |
|---|---|
| dbo:abstract | Condorcetova metoda je volební systém, v němž zvítězí kandidát, který by vyhrál proti libovolnému z protikandidátů, pokud by se utkali v hlasování jen oni dva. Tato podmínka se nazývá Condorcetovo kritérium a takto zvolený kandidát Condorcetův vítěz. Konkrétních metod splňujících Condorcetovo kritérium je více, jde tedy spíše o skupinu Condorcetových metod, které jsou pojmenovány po francouzském matematikovi 18. století Nicolasi Condorcetovi, který tyto systémy popsal. Condorcetův vítěz nemusí existovat, může se teoreticky stát, že preference voličů jsou cyklické - například při volbě tří kandidátů by teoreticky mohla nastat situace, kdy kandidát A by v soutěži s kandidátem B vyhrál, B by vyhrál s C a C by vyhrál s A. Jde o takzvaný Condorcetův paradox. Ve volbách s velkým počtem voličů ale prakticky nenastává, podobně jako remízy u jiných volebních systémů. Pokud nastane, záleží na konkrétní zvolené metodě, jak určí vítěze. Většina Condorcetových metod má jedno kolo hlasování, ve kterém každý volič řadí kandidáty od nejvíce populárního (číslo 1) po nejméně populární (stále vyšší čísla). Liší se způsobem sčítání hlasů, ale všechny určí stejného Condorcetova vítěze, pokud existuje. V případech, kdy Condorcetův vítěz neexistuje, mohou určit každý jiného vítěze podle druhotného kritéria, který preferují. (cs) Kondorcet-balotado estas balotsistemo, kiu kongruas kun la Kondorcet-kriterio. Ekzemploj de Kondorcet-balotadoj estas: * * * Paroranga metodo * (eo) A Condorcet method (English: /kɒndɔːrˈseɪ/; French: [kɔ̃dɔʁsɛ]) is an election method that elects the candidate who wins a majority of the vote in every head-to-head election against each of the other candidates, that is, a candidate preferred by more voters than any others, whenever there is such a candidate. A candidate with this property, the pairwise champion or beats-all winner, is formally called the Condorcet winner. The head-to-head elections need not be done separately; a voter's choice within any given pair can be determined from the ranking. Some elections may not yield a Condorcet winner because voter preferences may be cyclic—that is, it is possible (but rare) that every candidate has an opponent that defeats them in a two-candidate contest.(This is similar to the game rock paper scissors, where each hand shape wins against one opponent and loses to another one). The possibility of such cyclic preferences is known as the Condorcet paradox. However, a smallest group of candidates that beat all candidates not in the group, known as the Smith set, always exists. The Smith set is guaranteed to have the Condorcet winner in it should one exist. Many Condorcet methods elect a candidate who is in the Smith set absent a Condorcet winner, and is thus said to be "Smith-efficient". The Condorcet winner is also usually but not necessarily the utilitarian winner (the one that maximizes social welfare). Condorcet voting methods are named for the 18th-century French mathematician and philosopher Marie Jean Antoine Nicolas Caritat, the Marquis de Condorcet, who championed such systems. However, Ramon Llull devised the earliest known Condorcet method in 1299. It was equivalent to Copeland's method in cases with no pairwise ties. Condorcet methods may use preferential ranked, rated vote ballots, or explicit votes between all pairs of candidates. Most Condorcet methods employ a single round of preferential voting, in which each voter ranks the candidates from most (marked as number 1) to least preferred (marked with a higher number). A voter's ranking is often called their order of preference. Votes can be tallied in many ways to find a winner. All Condorcet methods will elect the Condorcet winner if there is one. If there is no Condorcet winner different Condorcet-compliant methods may elect different winners in the case of a cycle—Condorcet methods differ on which other criteria they satisfy. The procedure given in Robert's Rules of Order for voting on motions and amendments is also a Condorcet method, even though the voters do not vote by expressing their orders of preference. There are multiple rounds of voting, and in each round the vote is between two of the alternatives. The loser (by majority rule) of a pairing is eliminated, and the winner of a pairing survives to be paired in a later round against another alternative. Eventually, only one alternative remains, and it is the winner. This is analogous to a single-winner or round-robin tournament; the total number of pairings is one less than the number of alternatives. Since a Condorcet winner will win by majority rule in each of its pairings, it will never be eliminated by Robert's Rules. But this method cannot reveal a voting paradox in which there is no Condorcet winner and a majority prefer an early loser over the eventual winner (though it will always elect someone in the Smith set). A considerable portion of the literature on social choice theory is about the properties of this method since it is widely used and is used by important organizations (legislatures, councils, committees, etc.). It is not practical for use in public elections, however, since its multiple rounds of voting would be very expensive for voters, for candidates, and for governments to administer. (en) Condorcet-Methoden (nach Marie Jean Antoine Nicolas Caritat, Marquis de Condorcet) sind Präferenzwahlen, bei denen ein Kandidat zumindest dann gewinnt, wenn er jedem anderen Kandidaten im direkten Vergleich vorgezogen wird. Jeder Wähler ordnet die Kandidaten nach Rang, wobei mehrere Kandidaten auf demselben Rang möglich sind. Bei der Auswertung werden aus den Daten der Stimmabgaben Zweikämpfe simuliert, in denen jeder Kandidat gegen jeden anderen Kandidaten antritt. Dazu wird gezählt, wie oft ein Kandidat über seinem Gegner angeordnet ist. Wer jeden dieser Kämpfe gewinnt, ist Condorcet-Sieger. Alle Condorcet-Methoden sind sich vollkommen einig über den Gewinner, wenn jemand Condorcet-Sieger ist. Sie unterscheiden sich darin, wen sie als Gewinner festlegen, wenn es keinen Condorcet-Sieger gibt. Die Sozialwahltheorie untersucht und vergleicht u. a. unterschiedliche Aggregationsverfahren und deren Probleme und Vorzüge. Dabei wird die Möglichkeit von taktischem Abstimmungsverhalten der Wähler mit dem Ziel, das für einen selbst bestmögliche Wahlergebnis durchzusetzen, nicht berücksichtigt. („Zwar wäre mir Kandidat A am liebsten, aber da er keine Aussicht hat zu gewinnen, stimme ich für Kandidat B, der für mich der zweitbeste ist.“) Derartige Überlegungen können bei realen Abstimmungen nicht ausgeschlossen werden. (de) El método de Condorcet es un sistema de votación para elegir a una persona entre un grupo de candidatos. Los votantes ordenan de mayor a menor preferencia a los candidatos. Hay muchos métodos diferentes que cumplen la condición para ser considerados métodos de Condorcet. El nombre viene de su inventor, Marie Jean Antoine Nicolas Caritat, el Marqués de Condorcet, un matemático y filósofo del siglo XVIII. Ramon Llull diseñó un método que cumple el criterio de Condorcet en 1299 pero su método se basaba en un procedimiento iterativo, en lugar de marcar la preferencia de los candidatos en una papeleta. (es) La méthode Condorcet (aussi appelée scrutin de Condorcet ou vote Condorcet) est un système de vote obéissant au principe de Condorcet qui s'énonce ainsi :« si un choix est préféré à tout autre par une majorité ou une autre, alors ce choix doit être élu. » Le vainqueur, s'il existe, est donc le candidat qui, comparé tour à tour à chacun des autres candidats, s’avère à chaque fois être le candidat préféré. Autrement dit, il bat tous les autres en duel. Un tel candidat est appelé vainqueur de Condorcet. Rien ne garantit la présence d'un candidat satisfaisant à ce critère de victoire : c'est le paradoxe de Condorcet. Ainsi, tout système de vote fondé sur la méthode Condorcet doit prévoir un moyen de résoudre les votes pour lesquels ce candidat idéal n'existe pas. Cette méthode doit son nom à Nicolas de Condorcet, mathématicien et philosophe français du XVIIIe siècle, qui la justifie à partir d'une réflexion mathématique sur les probabilités d'erreur de jugement de la part des électeurs. La méthode est déjà mentionnée par l'écrivain catalan Raymond Lulle au XIIIe siècle. Dans un contexte politique de type gauche/centre/droite, le théorème de l'électeur médian indique que l'option centriste est le vainqueur de Condorcet quand elle bat les options de gauche (avec l'aide des voix de droite), et les options de droite (avec les voix de gauche). (fr) De methode Condorcet is een manier om verkiezingen te houden. De condorcetwinnaar van een verkiezing is de kandidaat die, wanneer om de beurt met elke andere kandidaat vergeleken, wordt verkozen boven de andere kandidaat. Een condorcetwinnaar zal niet altijd bestaan (zie paradox van Condorcet) hetgeen betekent dat een alternatieve winnaar moet worden gekozen. Elk stemsysteem dat de condorcetwinnaar kiest wanneer die bestaat heet een methode Condorcet, naar de bedenker, de 18e-eeuwse wiskundige en filosoof Condorcet, al lijkt de methode al bedacht te zijn in de 13e eeuw door Ramon Llull. Andere vergelijkbare termen zijn: * Condorcetverliezer: de kandidaat die minder gewenst wordt dan elke andere kandidaat in een paarsgewijze vergelijking. * zwakke condorcetwinnaar: een kandidaat die wint of gelijkstaat met elke andere kandidaat in een paarsgewijze vergelijking. Er kan meer dan een zwakke condorcetwinnaar voorkomen. * zwakke condorcetverliezer: een kandidaat die verliest of gelijkstaat met elke andere kandidaat in een paarsgewijze vergelijking. Er kan ook meer dan een zwakke condorcetverliezer voorkomen. (nl) O método de Condorcet é qualquer método de eleição para eleger um candidato único atendendo o critério de Condorcet. O vencedor de Condorcet, quando existe, é o candidato que venceria cada um dos outros candidatos numa eleição separada só com os dois. Nos exemplos modernos, os eleitores classificarão os candidatos em ordem de preferência. Os métodos de Condorcet, são nomeados de acordo com o matemático e filósofo francês do século XVIII, Marie Jean Antoine Nicolas Caritat, o marquês de Condorcet (pronuncia-se "condorsé", sem o t). Ramon Llull tinha planejado um dos primeiros métodos de Condorcet em 1299, mas esse método é baseado em um processo iterativo ao invés de uma cédula de votação. (pt) Condorcet-metoder är en klass av valsystem. De uppfyller alla , vilket innebär att om det finns en kandidat som stöds av en majoritet av väljarna gentemot varje annan kandidat så måste den kandidaten väljas som vinnare. En sådan kandidat kallas för Condorcet-vinnare. Det finns inte alltid en Condorcet-vinnare. Om vi har minst tre kandidater, exempelvis Anna, Bengt och Cecilia och Anna vinner över Bengt, Bengt vinner över Cecilia och Cecilia vinner över Anna har ingen stöd av majoriteten mot alla de övriga. Att en sådan situation, när ingen har majoritet mot alla andra, kan uppstå kallas för Condorcet-paradoxen. De olika Condorcet-metoderna skiljer sig åt i hur de hanterar en situation med en Condorcet-paradox. Klassen av valsystem är döpta efter Nicolas de Condorcet som levde under 1700-talet och var matematiker och filosof. Den tidigast kända Condorcet-metoden beskrevs av Ramon Llull 1299, en metod som är nästan identisk med . Oftast får väljarna lämna in en valsedel med kandidaterna rangordnade. Om en kandidat, säg Anna, står över Bengt och Cecilia på valsedeln räknas det som en röst för Anna mot Bengt och en röst för Anna mot Cecilia. Sällan genomförs flera separata valomgångar, även om det också är möjligt. Vissa Condorcet-metoder tillåter att en väljare inte rangordnar alla kandidaterna, exempelvis låter Anna och Bengt rankas delat högst och Cecilia sist. Många valsystem uppfyller inte Condorcet-kriteriet och är därför inte Condorcet-metoder, exempelvis Bordaräkning som använts i melodifestivalen och alternativröstning som används i flera länder. I dem kan alltså en kandidat som vinner en-mot-en mot alla andra kandidater förlora valet. (sv) 孔多塞制（Condorcet voting），或稱雙序制，是由法國數學家與政治家孔多塞以衍生的投票制度。 投票者將候選人或候選的項目隨自己的喜好而排名，例如第一意願寫「1」，第二意願寫「2」，如此類推。這種方法將每個選項與所有其他的選項成對比較，一次一個，而擊敗所有其他選項的選項便是贏家。只要一個選項在大多數選票上的位置高於另一個選項，那麼它便擊敗了那個選項。 例如，在三名候选人中，一个候选人可能具有最少的第一选择，但与其他两个候选人赢得了面对面的选举。 這些方法通常被稱為孔多塞制，因為孔多塞準則確保了它們在大多數選舉中都能獲得一樣的結果，也就是存在著一個孔多塞贏家。不同孔多塞制之間的差別在於出現沒有選項被擊敗時的情況，意味著產生了一個選項之間不斷擊敗對方的循環，這被稱為孔多塞悖論。為了解決孔多塞悖論的循環，當沒有孔多塞贏家出現而選擇特定孔多塞版本來決定贏家的狀況被稱為孔多塞完結法。大多数Condorcet方法都通过Smith准则（它们总是从Smith集中选择候选者）。史密斯集是最小的主导集。主导群体是一组候选人，击败所有不在该组中的候选人。 Smith 例: A, B, C, D, E 在史密斯集。 另一個簡單的孔多塞制是（Minimax）制：如果沒有選項沒被擊敗，那麼被最少的選票擊敗的選項獲勝。近年來還有由（Markus Schulze）設計的舒爾茨制，以及（Nicolaus Tideman）設計的制（Ranked Pairs），兩種方法都以達成眾多投票制度評價標準為目標。 (zh) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Preferential_ballot.svg?width=300 |
| dbo:wikiPageExternalLink | http://accuratedemocracy.com/ http://condorcet.ca/ http://condorcet.ericgorr.net/ http://m-schulze.9mail.de/schulze1.pdf http://pj.freefaculty.org/Ukraine/PJ3_VotingSystemsEssay.pdf http://radicalcentrism.org/resources/maximum-majority-voting/ http://robla.net/1996/politics/condorcet.html http://stv.sourceforge.net/ http://www.condorcet.vote/ http://www.mcdougall.org.uk/VM/ISSUE3/P5.HTM http://www.votefair.org/surveys.html https://civs1.civs.us/ https://dev.entrouvert.org/projects/wcs https://electowiki.org/wiki/Smith/Score https://www.thehivemind.com/ http://www2.uah.es/docecon/documentos/DT1.pdf https://elekto.dev https://archive.org/details/theoryofcommitte0000blac https://github.com/cpsolver/VoteFair-ranking-cpp https://github.com/julien-boudry/Condorcet https://web.archive.org/web/20041030073537/http:/www.accuratedemocracy.com/ https://web.archive.org/web/20160303171153/http:/www3.uah.es/docecon/documentos/DT1.pdf https://www.debian.org/vote/ |
| dbo:wikiPageID | 44446 (xsd:integer) |
| dbo:wikiPageInterLanguageLink | dbpedia-he:מועמד_קונדורסה |
| dbo:wikiPageLength | 73814 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1118089065 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Baldwin's_method dbr:Rock-paper-scissors dbr:Monotonicity_criterion dbr:Student_housing_cooperative dbr:Participation_criterion dbr:Bernard_Grofman dbr:Debian dbc:Single-winner_electoral_systems dbr:Peyton_Young dbr:Robert's_Rules_of_Order dbr:United_Kingdom dbr:United_States dbr:Duverger's_law dbr:Independence_of_Smith-dominated_alternatives dbr:Independence_of_clones_criterion dbr:Independence_of_irrelevant_alternatives dbr:Instant-runoff_voting dbr:Integer_programming dbr:Intransitivity dbr:Schulze_method dbr:Alma_Mater_Society_of_the_University_of_British_Columbia dbr:Library_(computing) dbr:Comparison_of_electoral_systems dbr:Matrix_(mathematics) dbr:Median dbr:Chicken_(game) dbr:Schwartz_set dbr:Usenet dbr:Free_State_Project dbr:Gentoo_Linux dbc:Condorcet_methods dbr:Condorcet's_jury_theorem dbr:Condorcet_loser_criterion dbr:Condorcet_paradox dbr:Consistency_criterion dbr:Copeland's_method dbr:Ratings_ballot dbr:Andranik_Tangian dbr:Libertarian_Party_of_Washington dbr:Plurality_voting dbr:Majority_criterion dbr:Majority_loser_criterion dbr:Majority_rule dbr:Political_spectrum dbr:Mathematician dbr:Matrix_addition dbr:Resolvability_criterion dbr:Mutual_majority_criterion dbr:Wikimedia_Foundation dbr:Dodgson's_method dbr:Landau_set dbr:Later-no-harm_criterion dbr:Later-no-help_criterion dbr:Reversal_symmetry dbr:Social_welfare_function dbr:Minimax_Condorcet dbr:Duncan_Black dbc:Preferential_electoral_systems dbr:PHP dbr:Cardinal_voting dbr:Kemeny–Young_method dbr:Rock_paper_scissors dbr:First-past-the-post dbr:Tactical_voting dbr:Nicolaus_Tideman dbr:Marquette,_Michigan dbr:Marquis_de_Condorcet dbr:Borda_count dbr:CPO-STV dbr:Pirate_Party_(Sweden) dbr:Software_in_the_Public_Interest dbr:Polynomial_time dbr:Kingman_Hall dbr:Kubernetes dbr:Ramon_Llull dbr:Ranked_voting_systems dbr:Write-in_candidate dbr:Ranked_Pairs dbr:Round-robin_tournament dbr:Schulze_STV dbr:Utility dbr:Plurality_criterion dbr:Nanson's_method dbr:Score_voting dbr:Hillegass_Parker_House dbr:Multiwinner_voting dbr:Philosopher dbr:Single_peaked_preferences dbr:Lexicographical_order dbr:Smith_set dbr:Ranked_pairs dbr:Ranked_voting dbr:Plurality_voting_system dbr:Voting_paradox dbr:Smith_criterion dbr:Election_method dbr:Donkey_voting dbr:Condorcet_Kemeny dbr:Condorcet_cycle dbr:Condorcet_voting dbr:Tideman's_alternative_method dbr:Later-no-harm dbr:File:Preferential_ballot.svg dbr:File:Voting2.png |
| dbp:colwidth | 30 (xsd:integer) |
| dbp:group | "footnotes" (en) |
| dbp:wikiPageUsesTemplate | dbt:Citation dbt:Citation_needed dbt:Cite_book dbt:Essay dbt:IPA-fr dbt:IPAc-en dbt:Main dbt:More_citations_needed_section dbt:Multiple_issues dbt:No dbt:Original_research dbt:Partial dbt:Portal dbt:Reflist dbt:See_also dbt:Short_description dbt:Unreferenced_section dbt:Yes dbt:Voting_systems dbt:Diagonal_split_header dbt:Electoral_systems dbt:Tenn_voting_example |
| dct:subject | dbc:Single-winner_electoral_systems dbc:Condorcet_methods dbc:Preferential_electoral_systems |
| rdf:type | owl:Thing yago:WikicatCondorcetMethods yago:WikicatMathematicsParadoxes yago:WikicatVotingSystems yago:WikicatSingle-winnerElectoralSystems yago:Ability105616246 yago:Abstraction100002137 yago:Cognition100023271 yago:Communication100033020 yago:Content105809192 yago:Contradiction107206887 yago:Falsehood106756407 yago:Idea105833840 yago:Know-how105616786 yago:LegalSystem105903229 yago:Message106598915 yago:Method105660268 yago:Paradox106724559 yago:Plan105898568 yago:PlanOfAction105902545 yago:PsychologicalFeature100023100 yago:Statement106722453 yago:System105902872 yago:VotingSystem105904135 yago:WikicatElectoralSystems yago:WikicatPreferentialElectoralSystems |
| rdfs:comment | Kondorcet-balotado estas balotsistemo, kiu kongruas kun la Kondorcet-kriterio. Ekzemploj de Kondorcet-balotadoj estas: * * * Paroranga metodo * (eo) El método de Condorcet es un sistema de votación para elegir a una persona entre un grupo de candidatos. Los votantes ordenan de mayor a menor preferencia a los candidatos. Hay muchos métodos diferentes que cumplen la condición para ser considerados métodos de Condorcet. El nombre viene de su inventor, Marie Jean Antoine Nicolas Caritat, el Marqués de Condorcet, un matemático y filósofo del siglo XVIII. Ramon Llull diseñó un método que cumple el criterio de Condorcet en 1299 pero su método se basaba en un procedimiento iterativo, en lugar de marcar la preferencia de los candidatos en una papeleta. (es) O método de Condorcet é qualquer método de eleição para eleger um candidato único atendendo o critério de Condorcet. O vencedor de Condorcet, quando existe, é o candidato que venceria cada um dos outros candidatos numa eleição separada só com os dois. Nos exemplos modernos, os eleitores classificarão os candidatos em ordem de preferência. Os métodos de Condorcet, são nomeados de acordo com o matemático e filósofo francês do século XVIII, Marie Jean Antoine Nicolas Caritat, o marquês de Condorcet (pronuncia-se "condorsé", sem o t). Ramon Llull tinha planejado um dos primeiros métodos de Condorcet em 1299, mas esse método é baseado em um processo iterativo ao invés de uma cédula de votação. (pt) Condorcetova metoda je volební systém, v němž zvítězí kandidát, který by vyhrál proti libovolnému z protikandidátů, pokud by se utkali v hlasování jen oni dva. Tato podmínka se nazývá Condorcetovo kritérium a takto zvolený kandidát Condorcetův vítěz. Konkrétních metod splňujících Condorcetovo kritérium je více, jde tedy spíše o skupinu Condorcetových metod, které jsou pojmenovány po francouzském matematikovi 18. století Nicolasi Condorcetovi, který tyto systémy popsal. (cs) Condorcet-Methoden (nach Marie Jean Antoine Nicolas Caritat, Marquis de Condorcet) sind Präferenzwahlen, bei denen ein Kandidat zumindest dann gewinnt, wenn er jedem anderen Kandidaten im direkten Vergleich vorgezogen wird. Jeder Wähler ordnet die Kandidaten nach Rang, wobei mehrere Kandidaten auf demselben Rang möglich sind. Bei der Auswertung werden aus den Daten der Stimmabgaben Zweikämpfe simuliert, in denen jeder Kandidat gegen jeden anderen Kandidaten antritt. Dazu wird gezählt, wie oft ein Kandidat über seinem Gegner angeordnet ist. Wer jeden dieser Kämpfe gewinnt, ist Condorcet-Sieger. (de) A Condorcet method (English: /kɒndɔːrˈseɪ/; French: [kɔ̃dɔʁsɛ]) is an election method that elects the candidate who wins a majority of the vote in every head-to-head election against each of the other candidates, that is, a candidate preferred by more voters than any others, whenever there is such a candidate. A candidate with this property, the pairwise champion or beats-all winner, is formally called the Condorcet winner. The head-to-head elections need not be done separately; a voter's choice within any given pair can be determined from the ranking. (en) La méthode Condorcet (aussi appelée scrutin de Condorcet ou vote Condorcet) est un système de vote obéissant au principe de Condorcet qui s'énonce ainsi :« si un choix est préféré à tout autre par une majorité ou une autre, alors ce choix doit être élu. » Le vainqueur, s'il existe, est donc le candidat qui, comparé tour à tour à chacun des autres candidats, s’avère à chaque fois être le candidat préféré. Autrement dit, il bat tous les autres en duel. Un tel candidat est appelé vainqueur de Condorcet. (fr) De methode Condorcet is een manier om verkiezingen te houden. De condorcetwinnaar van een verkiezing is de kandidaat die, wanneer om de beurt met elke andere kandidaat vergeleken, wordt verkozen boven de andere kandidaat. Een condorcetwinnaar zal niet altijd bestaan (zie paradox van Condorcet) hetgeen betekent dat een alternatieve winnaar moet worden gekozen. Elk stemsysteem dat de condorcetwinnaar kiest wanneer die bestaat heet een methode Condorcet, naar de bedenker, de 18e-eeuwse wiskundige en filosoof Condorcet, al lijkt de methode al bedacht te zijn in de 13e eeuw door Ramon Llull. (nl) Condorcet-metoder är en klass av valsystem. De uppfyller alla , vilket innebär att om det finns en kandidat som stöds av en majoritet av väljarna gentemot varje annan kandidat så måste den kandidaten väljas som vinnare. En sådan kandidat kallas för Condorcet-vinnare. Klassen av valsystem är döpta efter Nicolas de Condorcet som levde under 1700-talet och var matematiker och filosof. Den tidigast kända Condorcet-metoden beskrevs av Ramon Llull 1299, en metod som är nästan identisk med . (sv) 孔多塞制（Condorcet voting），或稱雙序制，是由法國數學家與政治家孔多塞以衍生的投票制度。 投票者將候選人或候選的項目隨自己的喜好而排名，例如第一意願寫「1」，第二意願寫「2」，如此類推。這種方法將每個選項與所有其他的選項成對比較，一次一個，而擊敗所有其他選項的選項便是贏家。只要一個選項在大多數選票上的位置高於另一個選項，那麼它便擊敗了那個選項。 例如，在三名候选人中，一个候选人可能具有最少的第一选择，但与其他两个候选人赢得了面对面的选举。 這些方法通常被稱為孔多塞制，因為孔多塞準則確保了它們在大多數選舉中都能獲得一樣的結果，也就是存在著一個孔多塞贏家。不同孔多塞制之間的差別在於出現沒有選項被擊敗時的情況，意味著產生了一個選項之間不斷擊敗對方的循環，這被稱為孔多塞悖論。為了解決孔多塞悖論的循環，當沒有孔多塞贏家出現而選擇特定孔多塞版本來決定贏家的狀況被稱為孔多塞完結法。大多数Condorcet方法都通过Smith准则（它们总是从Smith集中选择候选者）。史密斯集是最小的主导集。主导群体是一组候选人，击败所有不在该组中的候选人。 Smith 例: A, B, C, D, E 在史密斯集。 (zh) |
| rdfs:label | Condorcetova metoda (cs) Condorcet-Methode (de) Kondorcet-balotado (eo) Método de Condorcet (es) Condorcet method (en) Metodo Condorcet (it) Méthode de Condorcet (fr) Methode Condorcet (nl) Método de Condorcet (pt) 孔多塞投票法 (zh) Condorcet-metod (sv) |
| rdfs:seeAlso | dbr:Tactical_voting |
| owl:sameAs | freebase:Condorcet method yago-res:Condorcet method wikidata:Condorcet method dbpedia-cs:Condorcet method dbpedia-de:Condorcet method dbpedia-eo:Condorcet method dbpedia-es:Condorcet method dbpedia-fa:Condorcet method dbpedia-fi:Condorcet method dbpedia-fr:Condorcet method dbpedia-hu:Condorcet method dbpedia-it:Condorcet method dbpedia-nl:Condorcet method dbpedia-pt:Condorcet method dbpedia-simple:Condorcet method dbpedia-sv:Condorcet method dbpedia-th:Condorcet method dbpedia-zh:Condorcet method https://global.dbpedia.org/id/52Gwf |
| prov:wasDerivedFrom | wikipedia-en:Condorcet_method?oldid=1118089065&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Preferential_ballot.svg wiki-commons:Special:FilePath/Voting2.png |
| foaf:isPrimaryTopicOf | wikipedia-en:Condorcet_method |
| is dbo:wikiPageDisambiguates of | dbr:Condorcet_(disambiguation) |
| is dbo:wikiPageRedirects of | dbr:Condorcet_Criterion dbr:Condorcet_methods dbr:Condorcet_ranking dbr:Condorcet_Method dbr:Pairwise_counting dbr:Beats-all_winner dbr:Round-robin_voting dbr:Concordet_method dbr:Condorcet's_Method dbr:Condorcet's_method dbr:Condorcet_candidate dbr:Condorcet_comparison dbr:Condorcet_condition dbr:Condorcet_election dbr:Condorcet_eletion dbr:Condorcet_method) dbr:Condorcet_voting dbr:Condorcet_voting_method dbr:Condorcet_voting_methods dbr:Condorcets_Method dbr:Majority_alternative dbr:Instant_Round-Robin_voting dbr:Weak_Condorcet_winner |
| is dbo:wikiPageWikiLink of | dbr:Election dbr:Electoral_reform dbr:Electoral_system dbr:List_of_atheist_philosophers dbr:List_of_electoral_systems dbr:List_of_eponyms_(A–K) dbr:Minimax_Condorcet_method dbr:Participation_criterion dbr:Approval_voting dbr:Homogeneity_criterion dbr:Peyton_Young dbr:D21_–_Janeček_method dbr:Vote_pairing dbr:Decision-making dbr:Independence_of_irrelevant_alternatives dbr:Instant-runoff_voting dbr:Intransitivity dbr:Schulze_method dbr:List_of_mathematics-based_methods dbr:List_of_political_scientists dbr:Post-election_pendulum_for_the_2013_Australian_federal_election dbr:Post-election_pendulum_for_the_2016_Australian_federal_election dbr:Post-election_pendulum_for_the_2019_Australian_federal_election dbr:Post-election_pendulum_for_the_2022_Australian_federal_election dbr:Post-election_pendulum_for_the_2022_Victorian_state_election dbr:Pre-election_pendulum_for_the_2016_Australian_federal_election dbr:Pre-election_pendulum_for_the_2022_Australian_federal_election dbr:Tideman_alternative_method dbr:Comparison_of_electoral_systems dbr:Condorcet,_Drôme dbr:Condorcet_Criterion dbr:Condorcet_methods dbr:Condorcet_ranking dbr:Schwartz_set dbr:1785_in_science dbr:Condorcet's_jury_theorem dbr:Condorcet_loser_criterion dbr:Condorcet_paradox dbr:Condorcet_winner_criterion dbr:Copeland's_method dbr:Lewis_Carroll dbr:Single_transferable_vote dbr:Mackerras_pendulum dbr:Majority_criterion dbr:Majority_loser_criterion dbr:STAR_voting dbr:Median_mechanism dbr:Median_voter_theorem dbr:Widest_path_problem dbr:Dodgson's_method dbr:Later-no-harm_criterion dbr:Reversal_symmetry dbr:2009_Burlington_mayoral_election dbr:Alma_Mater_Society_of_the_University_of_British_Columbia_Vancouver dbr:Duncan_Black dbr:Nonpartisan_blanket_primary dbr:Issues_affecting_the_single_transferable_vote dbr:Kemeny–Young_method dbr:Pairwise_comparison dbr:List_of_economists dbr:Black's_method dbr:Collective_animal_behavior dbr:Nicolaus_Tideman dbr:Referendum dbr:Marquis_de_Condorcet dbr:Borda_count dbr:CPO-STV dbr:Post-election_pendulum_for_the_2018_Victorian_state_election dbr:Sorin_Oprescu dbr:Bucklin_voting dbr:Round-robin_tournament dbr:Single-member_district dbr:Schulze_STV dbr:Top-four_primary dbr:Condorcet_(disambiguation) dbr:Condorcet_Method dbr:Plurality_criterion dbr:Summability_criterion dbr:First-past-the-post_voting dbr:Nanson's_method dbr:Score_voting dbr:Multiwinner_voting dbr:Two-round_system dbr:Review_site dbr:Vote_splitting dbr:Smith_set dbr:Ranked-choice_voting_in_the_United_States dbr:Ranked_pairs dbr:Strategic_voting dbr:Third_Vote dbr:Pairwise_counting dbr:Beats-all_winner dbr:Round-robin_voting dbr:Concordet_method dbr:Condorcet's_Method dbr:Condorcet's_method dbr:Condorcet_candidate dbr:Condorcet_comparison dbr:Condorcet_condition dbr:Condorcet_election dbr:Condorcet_eletion dbr:Condorcet_method) dbr:Condorcet_voting dbr:Condorcet_voting_method dbr:Condorcet_voting_methods dbr:Condorcets_Method dbr:Majority_alternative dbr:Instant_Round-Robin_voting dbr:Weak_Condorcet_winner |
| is rdfs:seeAlso of | dbr:Strategic_voting |
| is foaf:primaryTopic of | wikipedia-en:Condorcet_method |
