How to Choose Presentation Order Fairly
Create, publish and adjust a presentation sequence without repeat selection.
Published · Reviewed
How to Choose Presentation Order Fairly
A fair presentation order uses a complete eligible list, generates every position once and publishes the sequence before presentations begin. Adjustments for scheduling or accessibility should follow a stated rule rather than being made selectively after the order is known.
Recommended process
- Confirm the final presenters and remove duplicates.
- Generate one complete no-repeat order.
- Publish the sequence and adjustment policy.
- Record agreed swaps without rerandomizing unaffected positions.
Worked example
Six groups receive positions 1 through 6 from one shuffle. A group with an approved scheduling conflict swaps with the next willing group; the remaining four positions are left unchanged instead of rerunning the entire draw.
What to check before using the result
- Do not repeatedly regenerate to obtain a preferred order.
- Give presenters equal notice where possible.
- Keep the text sequence available as the authoritative list.
How the random step is handled
Random Picker Tools uses window.crypto.getRandomValues() for browser-based selection. Integer results use rejection sampling to avoid modulo bias, and complete list orders use a Fisher–Yates shuffle. This addresses the software selection step; the organizer still controls eligibility, duplicate rules, consent, accessibility and any legal requirements.
Privacy note
Normal picking and shuffling happen in the browser. Use initials or non-sensitive identifiers when possible, avoid storing unnecessary source data, and create a share link only when temporary server storage is appropriate for the people represented in the list.