CAT DILR Election Voting Sets: Preference Matrix Method
lection and voting DILR sets are an emerging, near-zero-competition CAT DILR format built on ranked preference data. This guide builds the preference matrix method from scratch, covers plurality, majority, and ranked-choice counting rules, and fully solves three verified sets, including a genuine strategic-voting paradox.
If you've hit a CAT DILR set with a table of named voters, ranked candidates, and a question asking who "wins," you've run into one of the newest set families in recent CAT and IIMB admission tests: election and voting DILR sets. They test something narrow and mechanical: whether you can turn ranked preference data into a matrix and apply the correct counting rule, plurality, majority, or ranked-choice elimination, without mixing the three up.
That narrowness is good news. Unlike arrangement sets, these follow a small number of well-defined rules once you know them. Almost nobody drills this format specifically, so a couple of hours on the method below buys a disproportionate edge over aspirants who freeze the moment a set says "preference order" instead of a seating chart.
Why election and voting DILR sets are CAT's newest curveball
Most DILR practice leans on classic formats: arrangements, groupings, tournaments, data games. Election and voting sets sit outside that comfort zone because the data isn't a fact ("X sits next to Y") but a ranking ("Voter group 3 prefers C over D over A"). Reading that ranking like a seating clue wastes time re-scanning the passage each question.
The fix: stop re-reading and start building a structure. For election and voting DILR CAT sets, that structure is the preference matrix, handling all three counting rules with one table.
Who should read this guide?
This guide is worth your time if:
- You've hit a DILR set built around voters, candidates, and rankings, and weren't sure where to start writing.
- You keep treating "most votes" and "majority" as the same thing, and it's cost you marks before.
- You want a genuinely low-competition DILR format, since so few aspirants drill preference-order sets specifically.
- You're solid on grouping and arrangement sets but ranked-preference data still feels unfamiliar.
The preference matrix: your core tool for every voting set
A preference matrix is a table with candidates as rows and voter blocs as columns. Each cell holds the rank that bloc assigns to that candidate: 1 for top choice, 2 for second, and so on. Build this in the first ninety seconds, before you touch a question, and every question after becomes a lookup instead of a re-read.
| Candidate (row) | Voter Bloc 1 | Voter Bloc 2 | Voter Bloc 3 |
|---|---|---|---|
| Candidate A | 1 | 3 | 2 |
| Candidate B | 2 | 1 | 3 |
| Candidate C | 3 | 2 | 1 |
Two habits make this matrix pay off. First, read down a column to recover one voter bloc's entire ranking in order, useful whenever a question asks about a single bloc's preferences. Second, read across a row to see how one candidate performed with every voter group at once, which is exactly what plurality and majority questions need. The matrix never changes between questions in the same set; only which row or column you scan does.
Write bloc sizes directly above each column header, not just the bloc label. Every plurality, majority, and elimination calculation reduces to adding up bloc sizes, and having them visible on the matrix saves you from flipping back to the passage mid-calculation, where most arithmetic slips happen under time pressure.
The voting rules CAT DILR expects you to recognise instantly
Once your matrix is built, the set asks you to apply one of a small handful of counting rules. Confusing these rules, not the arithmetic, is the biggest source of wrong answers here.
Plurality and majority get confused constantly, because everyday language treats "most votes" and "majority" as interchangeable. In an election voting DILR CAT set, they almost never are: a four-candidate race split 35, 28, 22, and 15 has a clear plurality winner at 35, but that's nowhere near a majority. Ranked-choice elimination exists to push a fragmented result toward a majority winner, one round at a time. Strategic voting shows up least often but rewards the deepest understanding, since it asks what would happen under a different, hypothetical vote.
Three solved election and voting DILR sets
Three full sets below, each built around one rule above, worked through with the matrix and verifiable arithmetic.
| Candidate | Bloc 1 (35) | Bloc 2 (28) | Bloc 3 (22) | Bloc 4 (15) |
|---|---|---|---|---|
| Aarav | 1 | 2 | 3 | 4 |
| Bhavna | 2 | 1 | 4 | 3 |
| Chetan | 3 | 4 | 1 | 2 |
| Divya | 4 | 3 | 2 | 1 |
Q1. Under plurality rules, who wins? Read the rank-1 row for each candidate: Aarav gets Bloc 1's 35 votes, Bhavna gets Bloc 2's 28, Chetan gets Bloc 3's 22, Divya gets Bloc 4's 15. These sum to 100, confirming no votes are unaccounted for. Aarav's 35 is the highest single total, so Aarav wins under plurality.
Q2. Does the plurality winner also have a majority? A majority needs more than 50 of the 100 votes. Aarav's 35 is only 35%, a full 16 votes short of the 51 needed for majority. So no: 65 of the 100 students, a clear majority of the electorate, ranked someone other than Aarav first, yet he still wins outright under plain plurality counting.
Q3. Which candidate is ranked last by the largest number of voters? Scan the rank-4 row instead: Aarav last for Bloc 4 (15), Bhavna last for Bloc 3 (22), Chetan last for Bloc 2 (28), Divya last for Bloc 1 (35). Divya is ranked dead last by more voters (35) than anyone else, even though her own bloc adores her. The matrix makes this instantly visible; a plain paragraph would bury it.
| Candidate | Bloc 1 (28) | Bloc 2 (24) | Bloc 3 (22) | Bloc 4 (16) | Bloc 5 (10) |
|---|---|---|---|---|---|
| Priya | 1 | 2 | 4 | 3 | 4 |
| Quresh | 2 | 1 | 3 | 4 | 1 |
| Rohan | 3 | 4 | 1 | 2 | 2 |
| Sana | 4 | 3 | 2 | 1 | 3 |
Q1. What does round 1 show? Priya = 28 (Bloc 1). Quresh = 24 + 10 = 34 (Bloc 2 and 5). Rohan = 22 (Bloc 3). Sana = 16 (Bloc 4). Total = 100. Quresh leads with 34, but a majority needs 51, so elimination begins.
Q2. Who is eliminated first, and where do their votes go? Sana has the fewest votes (16) and is eliminated. Bloc 4's ranking is Sana > Rohan > Priya > Quresh, so their next surviving preference is Rohan, who rises from 22 to 22 + 16 = 38. Round 2 tally: Priya 28, Quresh 34, Rohan 38. Still no majority, so elimination continues.
Q3. Who wins, and after how many rounds? In round 2, Priya has the fewest votes (28) and is eliminated next. Bloc 1's ranking is Priya > Quresh > Rohan > Sana, so their next preference is Quresh, who rises from 34 to 34 + 28 = 62. Final tally: Quresh 62, Rohan 38. Quresh crosses the 51-vote majority and wins after two elimination rounds, despite trailing a combined 66 votes for other candidates in round 1.
| Candidate | Bloc A (34) | Bloc B (32) | Bloc C (34) |
|---|---|---|---|
| Kavya | 1 | 2 | 3 |
| Naveen | 2 | 1 | 2 |
| Omkar | 3 | 3 | 1 |
Q1. Under honest voting, who is eliminated first and who wins? First preferences: Kavya = 34, Naveen = 32, Omkar = 34. Naveen has the fewest votes and is eliminated. Bloc B's ranking is Naveen > Kavya > Omkar, so their next preference is Kavya, whose total becomes 34 + 32 = 66, crossing the majority. Kavya wins, 66 to Omkar's 34.
Q2. Why is this outcome a problem specifically for Bloc C? Bloc C's honest ranking is Omkar > Naveen > Kavya, so Kavya is their least-preferred candidate. Because Omkar and Kavya nearly tied for first-preference votes while Naveen trailed slightly, Naveen's elimination sent his votes to Kavya, not Omkar, handing the win to the one candidate Bloc C ranked last. Voting honestly for their true favourite backfired completely.
Q3. How could Bloc C secure a strictly better outcome by misrepresenting their true first preference? Suppose Bloc C insincerely votes Naveen first instead of Omkar. New tally: Kavya = 34, Naveen = 32 + 34 = 66, Omkar = 0. Naveen already crosses the 51-vote majority outright, no elimination needed. Since Bloc C honestly prefers Naveen over Kavya, this misrepresentation, "favourite betrayal," gives them a strictly better result than voting honestly did. Your sincere first-preference vote can backfire; a calculated compromise protects you from your worst outcome.
Cover Set 2's Q2 and answer it cold: which candidate is eliminated first, and which surviving candidate absorbs their votes? Then check against the worked column lookup above. Getting the direction wrong usually means reading the eliminated bloc's rank-1 candidate instead of their next-ranked surviving one, exactly the slip this method prevents.
Common mistakes in election voting DILR CAT sets
A few errors show up repeatedly once aspirants attempt this set family under real time pressure.
Assuming the plurality leader automatically has a majority, without checking against 50%. Redistributing an eliminated candidate's votes to that bloc's overall favourite instead of their next surviving choice. Forgetting to recheck the majority threshold after every elimination round, since a set can need two or three rounds. And treating strategic-voting questions as a trick rather than a calculation, when they use the exact same matrix, just applied to a hypothetical vote.
Every one of these traces back to skipping the matrix and trying to hold rankings in your head instead. That same disciplined-table habit carries over from other DILR families; our guide to CAT DILR survey and poll sets uses a related response-matrix method for overlapping percentage data.
Election and voting sets reward the instinct that separates strong DILR scorers from the rest: build the structure first, then answer the question. The same discipline shows up in the "guaranteed versus possible" thinking behind CAT DILR sports tournament sets, and in spotting a buried logical trap in our guide to CAT data sufficiency advanced traps.
Not sure DILR is actually your biggest scoring gap? Run our CAT preparation gap analysis framework on your last three mocks first. The CAT exam hub collects guides across every DILR type, and the CAT score predictor shows how stronger DILR accuracy moves your overall percentile.
The bottom line
- Election and voting DILR CAT sets test preference-order data, not raw facts, but the fix is the same: build a structure before you answer.
- A preference matrix, candidates as rows, voters or blocs as columns, ranks as cells, handles plurality, majority, and ranked-choice questions with one table.
- Plurality is "most first-preference votes"; majority is "more than 50%." A plurality winner can easily lack a majority.
- Ranked-choice (instant-runoff) elimination removes the lowest candidate each round and redistributes their votes to voters' next surviving preference, repeating until someone crosses a majority.
- Strategic voting sets test whether you understand that an honest first-preference vote can sometimes produce a worse outcome than a calculated compromise, a genuine paradox worth recognising, not memorising.
Stop guessing at "new" DILR formats. Learn the method once.
Bring a recent election or preference-order DILR set to a free session. We'll build the matrix with you and show exactly where each counting rule changes the answer.
Book a Free CAT 2026 DILR Strategy SessionQuestions aspirants ask
Solve real CAT DILR sets timed
Hand-picked LR puzzles and DI caselets with timer + solution breakdown.