Condorcet method is an election system where voters rate their candidates in order of preference. As an example, for candidates A B and C, a valid vote can be [A > B > C], [C > B > A], [B > A > C] etc. If no candidate obtains the majority, the candidate who received the lowest number of votes is eliminated, and the 2nd choices of the voters that voted for her/him are redistributed among the existing candidates - as if it were first choices.
I would like to verify what is the best method to elect 2 candidates using the Condorcet method.
My preferred option would be asking the voters to provide 2 first choices, 1 second choice and 1 third choice. Then apply the Condorcet method to elect the two candidates.
In this case, my understanding is that the majority required to be elected should be determined by the following
[(valid votes cast\(seats to fill+1)] + 1
where the quota is an integer (Droop Quota).
This method could be assimiled at a Single Transferable vote where if a candidate has more votes than the quota, surplus votes doesn't need to be transferred to other candidates. In that case we would only elect the candidates that reached the majority required (Droop Quota) and eliminate the candidate that received the lowest number of first choices, redistributing the 2nd choices of the voters that voted for her/him. This operation should be repeated until a second candidate reach the majority, or until there is only two candidates left.
Would this method always work?