Condorcet method (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Condorcet method" in English language version.

Last modified:

Ref.Un. Ref.Website
Global rank English rank
2nd place
2nd place
15th place
8th place
4th place
4th place
1st place
1st place
23rd place
15th place
3rd place
3rd place
150th place
174th place
low place
low place
182nd place
172nd place
49th place
31st place
6th place
6th place
2,125th place
1,347th place
low place
low place
96th place
89th place
66th place
34th place
low place
low place
1,143rd place
973rd place
194th place
182nd place
785th place
374th place
low place
low place
low place
low place
low place
low place
1,383rd place
954th place
541st place
356th place
6,611th place
3,259th place
low place
low place
low place
low place
2,774th place
6,614th place
low place
low place

archive.org (Global: 6th place; English: 6th place)

  • Nanson, E. J. (1882). "Methods of election". Transactions and Proceedings of the Royal Society of Victoria. 19: 207–208. although Ware's method cannot return the worst, it may return the next worst.
  • Nanson, E. J. (1882). "Methods of election". Transactions and Proceedings of the Royal Society of Victoria. 19: 217.

archives-ouvertes.fr (Global: 1,143rd place; English: 973rd place)

halshs.archives-ouvertes.fr

arxiv.org (Global: 49th place; English: 31st place)

  • Darlington, Richard B. (2018). "Are Condorcet and minimax voting systems the best?". arXiv:1807.01366 [physics.soc-ph]. CC [Condorcet] systems typically allow tied ranks. If a voter fails to rank a candidate, they are typically presumed to rank them below anyone whom they did rank explicitly.
  • Schulze, Markus (2018). "The Schulze Method of Voting". p. 351. arXiv:1804.02973 [cs.GT]. The Condorcet criterion for single-winner elections (section 4.7) is important because, when there is a Condorcet winner b ∈ A, then it is still a Condorcet winner when alternatives a1,...,an ∈ A \ {b} are removed. So an alternative b ∈ A doesn't owe his property of being a Condorcet winner to the presence of some other alternatives. Therefore, when we declare a Condorcet winner b ∈ A elected whenever a Condorcet winner exists, we know that no other alternatives a1,...,an ∈ A \ {b} have changed the result of the election without being elected.

books.google.com (Global: 3rd place; English: 3rd place)

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

core.ac.uk (Global: 1,383rd place; English: 954th place)

  • Truchon, Michel (October 1998). "AN EXTENSION OF THE CONDORCET CRITERION AND KEMENY ORDERS" (PDF). A first objective of this paper is to propose a formalization of this idea, called the Extended Condorcet Criterion (XCC). In essence, it says that if the set of alternatives can be partitioned in such a way that all members of a subset of this partition defeat all alternatives belonging to subsets with a higher index, then the former should obtain a better rank than the latter.

doi.org (Global: 2nd place; English: 2nd place)

doi.org

dx.doi.org

electowiki.org (Global: low place; English: low place)

elekto.dev (Global: low place; English: low place)

equal.vote (Global: low place; English: low place)

  • "Condorcet". Equal Vote Coalition. Retrieved 2021-04-25.

hdl.handle.net (Global: 66th place; English: 34th place)

jstor.org (Global: 23rd place; English: 15th place)

liquidfeedback.org (Global: low place; English: low place)

principles.liquidfeedback.org

lpwa.org (Global: low place; English: low place)

mcdougall.org.uk (Global: low place; English: low place)

meta.wikimedia.org (Global: 2,774th place; English: 6,614th place)

natlib.govt.nz (Global: 785th place; English: 374th place)

rsnz.natlib.govt.nz

ox.ac.uk (Global: 541st place; English: 356th place)

nuff.ox.ac.uk

researchgate.net (Global: 96th place; English: 89th place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 182nd place; English: 172nd place)

link.springer.com

stanford.edu (Global: 194th place; English: 182nd place)

plato.stanford.edu

  • Pacuit, Eric (2019), "Voting Methods", in Zalta, Edward N. (ed.), The Stanford Encyclopedia of Philosophy (Fall 2019 ed.), Metaphysics Research Lab, Stanford University, retrieved 2020-10-16

uni-augsburg.de (Global: low place; English: low place)

math.uni-augsburg.de

usenet.org.uk (Global: low place; English: low place)

  • "Guidelines for Group Creation for uk.*". www.usenet.org.uk. Retrieved 2024-12-13. For a vote between several mutually exclusive options, the votetaking organisation will establish, for each possible pair of options A and B, how many voters prefer A over B and vice versa. … The method of determining the result when there are several mutually exclusive options, as described in paragraph 4 of The Result, is essentially that devised by the French mathematician the Marquis de Condorcet (1743-94).

vermont.gov (Global: 6,611th place; English: 3,259th place)

legislature.vermont.gov

votingmatters.org.uk (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

wiley.com (Global: 150th place; English: 174th place)

onlinelibrary.wiley.com

  • Barberà, Salvador; Bossert, Walter (2025-04-01). "Intermediate Condorcet Winners and Losers". Journal of Public Economic Theory. 27 (2). doi:10.1111/jpet.70024. ISSN 1097-3923. A candidate is a strong Condorcet winner for in if and is a strong Condorcet loser for in if the inequality … is reversed. … A candidate is a weak Condorcet winner for in if and is a weak Condorcet loser for in if the inequality … is reversed.

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

  • Tideman, T. Nicolaus; Plassmann, Florenz (2011). "Modeling the Outcomes of Vote-Casting in Actual Elections". SSRN Electronic Journal. doi:10.2139/ssrn.1627787. ISSN 1556-5068. A common definition of a voting cycle is the absence of a strict pairwise majority rule winner (SPMRW) … if no candidate beats all other candidates in pairwise comparisons.
  • Gehrlein, William V. (2011). Voting paradoxes and group coherence : the condorcet efficiency of voting rules. Lepelley, Dominique. Berlin: Springer. ISBN 9783642031076. OCLC 695387286. empirical studies ... indicate that some of the most common paradoxes are relatively unlikely to be observed in actual elections. ... it is easily concluded that Condorcet's Paradox should very rarely be observed in any real elections on a small number of candidates with large electorates, as long as voters' preferences reflect any reasonable degree of group mutual coherence
  • Gehrlein, William V. (2011). Voting paradoxes and group coherence : the condorcet efficiency of voting rules. Lepelley, Dominique. Berlin: Springer. ISBN 9783642031076. OCLC 695387286. empirical studies ... indicate that some of the most common paradoxes are relatively unlikely to be observed in actual elections. ... it is easily concluded that Condorcet's Paradox should very rarely be observed in any real elections on a small number of candidates with large electorates, as long as voters' preferences reflect any reasonable degree of group mutual coherence
  • Mackie, Gerry. (2003). Democracy defended. Cambridge, UK: Cambridge University Press. p. 6. ISBN 0511062648. OCLC 252507400.
  • Young, H. P. (1988). "Condorcet's Theory of Voting" (PDF). American Political Science Review. 82 (4): 1231–1244. doi:10.2307/1961757. ISSN 0003-0554. JSTOR 1961757. S2CID 14908863. Archived (PDF) from the original on 2018-12-22.
  • Barberà, Salvador; Bossert, Walter (2025-04-01). "Intermediate Condorcet Winners and Losers". Journal of Public Economic Theory. 27 (2). doi:10.1111/jpet.70024. ISSN 1097-3923. A candidate is a strong Condorcet winner for in if and is a strong Condorcet loser for in if the inequality … is reversed. … A candidate is a weak Condorcet winner for in if and is a weak Condorcet loser for in if the inequality … is reversed.