Lesson 6 of 8 · 15 min
Dominance matrices
Record round-robin results in a dominance matrix, count one-step and two-step dominances with and , and use them to rank competitors and break ties.
What you will be able to do
- Build a dominance matrix from results or a directed graph.
- Interpret row sums of as one-step dominances.
- Use to count two-step dominances and to rank competitors.
Five netball teams, A to E, play a round robin: every team plays every other team once, and there are no draws. Afterwards three teams have won two games each. Who should be ranked higher?
Counting wins is a start, but a win over a strong team ought to count for more than a win over a weak one. A dominance matrix lets you measure that.
An arrow from one team to another means the first team won. Ten arrows, one for each game. A, C and D each have two arrows going out.
Definition
Dominance matrix
For competitors, the dominance matrix is the matrix with
The leading diagonal is all (no one plays themselves). In a round robin with no draws, for each pair exactly one of and is .
For the netball results, with rows and columns in the order A, B, C, D, E:
Row lists who beat, so its row sum is 's number of wins, its one-step dominances. Columns list losses.
Using the matrix above, how many games did team B lose?
Now the clever part. A beat C, and C beat D, so A has an indirect, two-step dominance over D. Count them all by squaring the matrix: entry of is , and each product is exactly when beat and beat .
For the netball results (by hand, or with the calculator's matrix editor):
Row A is : A beats D in two steps in two ways, through B and through C, and A beats C in two steps once, through B.
Key idea
Ranking with D + D²
- Row sums of count one-step dominances.
- Row sums of count two-step dominances.
- Rank competitors by the row sums of , the total dominance.
If two competitors are still tied, look at the head-to-head result, or at .
Worked example
Rank teams with a dominance matrix
In a round-robin netball competition with no draws: A beat B and C; B beat C, D and E; C beat D and E; D beat A and E; E beat A.
Use a dominance matrix to rank the five teams.
Step 1: Build the dominance matrix
Rows are winners, in the order A, B, C, D, E:
Row sums (one-step): A , B , C , D , E . Three teams are tied.
Step 2: Square it
Row sums (two-step): A , B , C , D , E .
For example, the in row B, column A counts B → D → A and B → E → A.
Step 3: Total dominance
Row sums of : A , B , C , D , E .
Step 4: Break the remaining tie
C and D are still level on . C beat D in their game, so C is ranked above D.
Try it yourself first, then check the working one step at a time.
Answer
The ranking is B, A, C, D, E.
Method
Build with winners as rows.
Find (by hand or with technology) and the row sums of .
Rank by total dominance, then break ties by the head-to-head result.
Watch out for
Ranking by column sums, which count losses.
Squaring each entry of instead of multiplying by itself.
For the netball results, how many two-step dominances does team E have? (That is, the row sum for E in .)
In a round-robin competition with no draws, which statement is always true of the dominance matrix , for ?
Common mistake
Rows are wins, columns are losses
Always build with the winner as the row. Ranking by column sums ranks the teams by their losses, upside down. And don't put s on the diagonal: a team does not dominate itself.
Note
Beyond sport
Dominance matrices model any one-way relationship: which species preys on which in a food web, which person influences which in a social network, or which product beats another in head-to-head customer surveys.
Summary
In a dominance matrix, if dominates , else ; the diagonal is all zero.
Row sums of are one-step dominances (wins).
counts two-step dominances: beat someone who beat .
Rank by the row sums of ; break any remaining tie by the head-to-head result.
Finished the lesson?
Try the 3 quick checks above and the lesson completes itself, or mark it complete now.