PAIRWISE - How to calculate a fair number of rounds

In a Pairwise competition how to define a number of rounds which will give each option at least a few appearances
Currently an entry of 32 options with 64 rounds will leave a number of options with no appearances at all .
Is there a rough formula to use

The idea behind pairwise comparison is not that every individual participant sees or compares all options. Instead:

• Each participant is presented with only a few simple decisions
• Across many participants, a dense network of comparisons emerges
• From these comparisons, a relative ranking of all options can be derived

The cognitive load per participant is low, while the statistical reliability comes from aggregating many votes.

Because PollUnit pairs options randomly, there is no guarantee that every option will be shown. The probability of an option appearing can only be increased by increasing the number of rounds.

With N options and R rounds (each round is one comparison, showing two options):

avg = 2R / N

With 32 options and 64 rounds, each option appears 4 times on average.

Because pairing is random, appearances are uneven. To be very likely (99%) that an option appears at least once, you need roughly four times as many rounds as options.

May I ask what exactly your use case is? Do you want every participant to compare each option exactly once? If so, I could discuss this as a feature request in the team.