Perfect Stranger Table
Perfect stranger matching (PSM) describes a matching rule for repeated participantto- group allocations, where each participant may encounter any other participant only once. Enforcing PSM is often necessary in economic experiments since participants behave differently when interacting with strangers rather than partners (Berná, 2013; Andreoni and Croson, 2008).
The following table shows the summarized results of the perfect stranger matching problem for up to 40 participants (p). The number of participants equals the number of groups (n) multiplied by the group size (g). The table depicts the length of the longest sequence found for the respective number of groups and group size.
For more information, read this paper:
A randomized tabu search-based approach for perfect stranger matching in economic experiments
By F. Both, M.T.P Adam, A.Hariharan, V. Dorner, E. Lux, C. Weinhardt
You can find it here: http://www.sciencedirect.com/science/article/pii/S0165176516302324