<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Condorcet Loser &#x2F; Pairwise comparison &#x2F; Preference Matrix]]></title><description><![CDATA[<pre><code>   A,B,C,D,E
8: 3,0,1,1,1
5: 0,4,0,0,0
2: 0,1,3,2,1
1: 0,2,5,4,3
</code></pre>
<p dir="auto">Who is the Condorcet Looser (CL) and Condorect Winner (CW)?<br />
How to build the Preference Matrix (find CW and CL) - Pairwise comparison.</p>
<p dir="auto">Assume that election officials tossed a coin ahead of time - and the following Candidates were selected as tie breakers:</p>
<pre><code>1. A
2. B
3. C
4. D
5. E
</code></pre>
<p dir="auto">Tiebreaker candidates are selected from the above list, preferring candidates with lower numbers.</p>
<p dir="auto">We have 4 seats to win (with 5 candidates) - who should win this election?</p>
]]></description><link>http://www.votingtheory.org/forum/topic/404/condorcet-loser-pairwise-comparison-preference-matrix</link><generator>RSS for Node</generator><lastBuildDate>Sun, 19 Apr 2026 11:09:39 GMT</lastBuildDate><atom:link href="http://www.votingtheory.org/forum/topic/404.rss" rel="self" type="application/rss+xml"/><pubDate>Thu, 10 Aug 2023 17:39:56 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to Condorcet Loser &#x2F; Pairwise comparison &#x2F; Preference Matrix on Sat, 12 Aug 2023 00:24:07 GMT]]></title><description><![CDATA[<p dir="auto"><a class="plugin-mentions-user plugin-mentions-a" href="http://www.votingtheory.org/forum/uid/21">@masiarek</a> A is the only Nash equilibrium, while not a Condorcet winner it is in my opinion the only sensible winner of the election (being the only <em>weak</em> Condorcet winner). Every other candidate has another candidate that is preferred over them by a majority.</p>
<p dir="auto">Once A is elected, if they are removed from the running for second place, then B becomes a Condorcet loser and C becomes a Condorcet winner. If you continue with this process, either maximizing the rank of a remaining Condorcet winner and minimizing the rank of a remaining Condorcet loser, you arrive at the rank A,C,D,E,B. This process fails or is nondeterministic when there is a strong Condorcet cycle or more than one weak Condorcet winner.</p>
<p dir="auto">That ranking might not be your favorite, but it’s the most stable in terms of game theory. It’s strange that some voters didn’t use the full range of scores but in a rank order system that doesn’t matter.</p>
<p dir="auto">Another thing that one should keep in mind is that voting is for large populations. If the population is small, making social agreements is definitely way better for everyone!</p>
]]></description><link>http://www.votingtheory.org/forum/post/2772</link><guid isPermaLink="true">http://www.votingtheory.org/forum/post/2772</guid><dc:creator><![CDATA[cfrank]]></dc:creator><pubDate>Sat, 12 Aug 2023 00:24:07 GMT</pubDate></item><item><title><![CDATA[Reply to Condorcet Loser &#x2F; Pairwise comparison &#x2F; Preference Matrix on Thu, 10 Aug 2023 19:04:38 GMT]]></title><description><![CDATA[<p dir="auto"><a class="plugin-mentions-user plugin-mentions-a" href="http://www.votingtheory.org/forum/uid/21">@masiarek</a> There isn't a Condorcet winner or loser. A pairwise beats all candidates other than B and ties 8:8 with B. B loses pairwise against all candidates except A (they tie).</p>
<p dir="auto">With four to elect, I'd say A, B, C, D is the obvious choice, with E the weakest candidate. E is <a href="https://electowiki.org/wiki/Pareto_efficiency" rel="nofollow ugc">Pareto dominated</a> by C and D anyway, so C and D must be elected by any sensible measure.</p>
<p dir="auto">E does pairwise beat B (the only thing they have going for them), but B looks generally stronger and would have to be elected if this is a PR election.</p>
]]></description><link>http://www.votingtheory.org/forum/post/2769</link><guid isPermaLink="true">http://www.votingtheory.org/forum/post/2769</guid><dc:creator><![CDATA[Toby Pereira]]></dc:creator><pubDate>Thu, 10 Aug 2023 19:04:38 GMT</pubDate></item></channel></rss>