perfect-strangers
Construction routines for perfect stranger matching in behavioural studies.
Benchmarks
Perfect Stranger Matching
Under perfect stranger matching conditions, the maximum number of round possible using this package for various combinations of experiment parameters is given in the following table.
| Group Size | ||||||
|---|---|---|---|---|---|---|
| 2 | 3 | 4 | 5 | 6 | ||
Groups per Round | 2 | 3 | 1 | 1 | 1 | 1 |
| 3 | 5 | 4 | 1 | 1 | 1 | |
| 4 | 7 | 4 | 5 | 1 | 1 | |
| 5 | 9 | 7 | 5 | 6 | 1 | |
| 6 | 11 | 8 | 7 | 6 | 3 | |
| 7 | 13 | 10 | 9 | 7 | 7 | |
| 8 | 15 | 11 | 10 | 8 | 8 | |
| 9 | 17 | 13 | 11 | 9 | 9 | |
| 10 | 19 | 14 | 13 | 4 | 2 | |
| 11 | 21 | 16 | 11 | 11 | 11 | |
| 12 | 23 | 17 | 15 | 12 | 12 | |
| 13 | 25 | 19 | 17 | 13 | 13 | |
| 14 | 27 | 20 | 7 | 4 | 4 | |
| 15 | 29 | 22 | 5 | 6 | 3 | |
| 16 | 31 | 23 | 21 | 16 | 16 | |
| 17 | 33 | 25 | 17 | 17 | 17 | |
| 18 | 35 | 26 | 23 | 5 | 6 | |
| 19 | 37 | 28 | 25 | 19 | 19 | |
| 20 | 39 | 29 | 15 | 6 | 4 | |
Green cells indicate that this is a known optimal number of rounds. Orange cells indicate that a predefined set of groupings is used as published by Both et al. (2016)1. Blue cells indicate a construction approach which yields a number of rounds greater than or equal to that given by Both et al. (2016). Clicking cells redirects to the documentation for the method used to achieve each result.
Typed Perfect Stranger Matching
Maximum numbers of rounds for various typed perfect stranger matching configurations using this package are given below.
| Groups per Round | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | ||
Group Specification | [1, 1] | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| [1, 1, 1] | 1 | 3 | 4 | 5 | 3 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | |
| [2, 1] | 1 | 3 | 4 | 5 | 3 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | |
| [1, 1, 1, 1] | 1 | 1 | 4 | 5 | 2 | 7 | 8 | 9 | 5 | 11 | 12 | 13 | |
| [2, 1, 1] | 1 | 1 | 4 | 5 | 2 | 7 | 8 | 9 | 5 | 11 | 12 | 13 | |
| [2, 2] | 1 | 1 | 4 | 5 | 2 | 7 | 8 | 9 | 5 | 11 | 12 | 13 | |
| [3, 1] | 1 | 1 | 4 | 5 | 2 | 7 | 8 | 9 | 5 | 11 | 12 | 13 | |
| [1, 1, 1, 1, 1] | 1 | 1 | 1 | 5 | 2 | 7 | 8 | 9 | 3 | 11 | 12 | 13 | |
| [2, 1, 1, 1] | 1 | 1 | 1 | 5 | 2 | 7 | 8 | 9 | 3 | 11 | 12 | 13 | |
| [2, 2, 1] | 1 | 1 | 1 | 5 | 2 | 7 | 8 | 9 | 3 | 11 | 12 | 13 | |
| [3, 1, 1] | 1 | 1 | 1 | 5 | 2 | 7 | 8 | 9 | 3 | 11 | 12 | 13 | |
| [3, 2] | 1 | 1 | 1 | 5 | 2 | 7 | 8 | 9 | 3 | 11 | 12 | 13 | |
| [4, 1] | 1 | 1 | 1 | 5 | 2 | 7 | 8 | 9 | 3 | 11 | 12 | 13 | |
As above, green cells indicate that this is a known optimal number of rounds.
-
Both, F., Adam, M.T.P., Hariharan, A., Dorner, V., Lux, E. and Weinhardt, C., 2016. A randomized tabu search-based approach for perfect stranger matching in economic experiments. Economics Letters, 145, pp.235-238. DOI: 10.1016/j.econlet.2016.06.028 ↩