How to Create Random Pairs From One List
To create random pairs from one list, shuffle the eligible people once and group adjacent positions. Eight people create 4 pairs; if 7 people are eligible, the result is 3 pairs and 1 announced leftover, so the leftover rule must be set before the shuffle.
A worked example with numbers
Names A through H are shuffled into F, B, H, A, C, G, D, E. Pair adjacent entries: F–B, H–A, C–G, D–E. A particular person has 7 possible partners, each with probability 1/7 under a uniform shuffle. With 7 names, exactly one person is unpaired; choose whether that person joins a group of three, observes, or receives a defined bye before generating.
How to set the rule before the result
Use the pair generator after checking the roster. Use random partner assignment when the interface is framed as people rather than a generic list. Preserve the first pairing if it determines a shared activity.
Common mistakes that change the odds or the process
Do not draw a partner for each person independently: that can create duplicates, one-way pairings, and unmatched people. Do not resolve an odd count after seeing the leftover person. Do not treat identical first names as one person.
Where this method stops being appropriate
Pairing is random only among the supplied eligible names. It is not suitable if a safety, access, conflict, or supervision constraint requires a non-random assignment.
How the random source fits into the rule
NIST’s hypergeometric-distribution glossary
Apply the rule to the actual input
Use the pair generator after checking the roster. Use random partner assignment when the interface is framed as people rather than a generic list. Preserve the first pairing if it determines a shared activity.
Audit the calculation or allocation
Names A through H are shuffled into F, B, H, A, C, G, D, E. Pair adjacent entries: F–B, H–A, C–G, D–E. A particular person has 7 possible partners, each with probability 1/7 under a uniform shuffle. With 7 names, exactly one person is unpaired; choose whether that person joins a group of three, observes, or receives a defined bye before generating.
Do not import a different rule by accident
Do not draw a partner for each person independently: that can create duplicates, one-way pairings, and unmatched people. Do not resolve an odd count after seeing the leftover person. Do not treat identical first names as one person.
Limit of this specific method
Pairing is random only among the supplied eligible names. It is not suitable if a safety, access, conflict, or supervision constraint requires a non-random assignment.
Source and reproducibility
NIST’s hypergeometric-distribution glossary
Plan for an odd roster before pairing
| Eligible people | Pairs of two | People left over |
|---|---|---|
| 6 | 3 | 0 |
| 7 | 3 | 1 |
| 9 | 4 | 1 |
An odd number cannot be partitioned only into pairs. A transparent rule can name one trio, one rotating observer, or one bye; each has different social consequences. Do not label the result “fair pairs” without saying what happens to the remaining participant.
Count partners rather than output lines
In an eight-person pool, Avery has seven possible partners, not eight: Avery cannot pair with Avery. The full pairing output has four unordered pairs, but a process that first shuffles positions creates each permissible partner for Avery with the same 1/7 chance. Existing pair history, access needs, or a prohibition on one pairing is an input constraint. If any constraint matters, check it before the random operation rather than moving people after it.
Reproduce this result before relying on it
Random pairing is a no-repeat allocation in which each adjacent pair of one shuffled list becomes a group of two. Names A through H are shuffled into F, B, H, A, C, G, D, E. Pair adjacent entries: F–B, H–A, C–G, D–E. A particular person has 7 possible partners, each with probability 1/7 under a uniform shuffle. With 7 names, exactly one person is unpaired; choose whether that person joins a group of three, observes, or receives a defined bye before generating.
Choose the action that matches the stated rule
Use the pair generator after checking the roster. Use random partner assignment when the interface is framed as people rather than a generic list. Preserve the first pairing if it determines a shared activity. Do not draw a partner for each person independently: that can create duplicates, one-way pairings, and unmatched people. Do not resolve an odd count after seeing the leftover person. Do not treat identical first names as one person.
What the number does not decide
Pairing is random only among the supplied eligible names. It is not suitable if a safety, access, conflict, or supervision constraint requires a non-random assignment. NIST’s hypergeometric-distribution glossary
State the complete decision model
To create random pairs from one list, shuffle the eligible people once and group adjacent positions. Eight people create 4 pairs; if 7 people are eligible, the result is 3 pairs and 1 announced leftover, so the leftover rule must be set before the shuffle. Random pairing is a no-repeat allocation in which each adjacent pair of one shuffled list becomes a group of two.
Before publishing or using the outcome
Names A through H are shuffled into F, B, H, A, C, G, D, E. Pair adjacent entries: F–B, H–A, C–G, D–E. A particular person has 7 possible partners, each with probability 1/7 under a uniform shuffle. With 7 names, exactly one person is unpaired; choose whether that person joins a group of three, observes, or receives a defined bye before generating. Use the pair generator after checking the roster. Use random partner assignment when the interface is framed as people rather than a generic list. Preserve the first pairing if it determines a shared activity.
Keep a pairing record that can be checked
Save the original roster, the shuffled order, and the adjacent-pair rule. With six people, the output must contain exactly six distinct names across three pairs; a seventh occurrence signals a duplicated input or a faulty procedure. If pair labels matter, label them Pair 1 through Pair 3 after the shuffle rather than moving a preferred pair into a preferred slot.