Can Your Team Self-Organize?¶

Fiddler¶

In a recent team building exercise at work, a group of people (including myself) was asked to quantify themselves in various ways. For example: “What outdoor temperature do you prefer?” No one reveals their answer at first. Instead, each person places a card with their name on an unmarked line, one at a time. In this example, folks who prefer higher temperatures would place their names farther right; folks who prefer lower temperatures would place their names farther left. However, the line is unmarked and doesn’t have any units.

Once all the names are placed on the line, their values are revealed. For example, a group of six might have generated the following numbers, in order from left to right on the line: 60, 67, 65, 74, 70, 80.

The team’s score is the length of the “longest increasing subsequence.” In other words, it’s the maximum number of elements in the list you can keep such that they form an increasing subsequence. In the example above, you can remove the 67 and the 74 to get the following increasing subsequence with four numbers: 60, 65, 70, 80. There are a few other ways to get an increasing subsequence of length four, but there’s no way to get a sequence of length five or more, so the team’s score is four.

Suppose a total of four people are participating in this team building exercise. They all write down different numbers, and then independently place their names at random positions on the line.

On average, what do you expect the team’s score to be?

Solution¶

I considered teams of size $n$.

For the $k^\text{th}$ person in the team, denote their preferred temperature as $t_k$.

WLOG, assume $t_1 < t_2 < t_3 < \ldots < t_n$.

1 Person.¶

They will always have a maximum subsequence of $t_1$, which is the sequence.

$$\boxed{\text{average score} = 1}$$

2 People.¶

There are 2 possibilities:

  1. $t_2, t_1$, maximum subsequence $=1$.
  2. $t_1, t_2$, maximum subsequence $=2$.
$$\boxed{\text{average score} = 1.5}$$

3 People.¶

There are 6 possibilities:

  1. $t_3, t_2, t_1$, maximum subsequence $=1$.
  2. $t_2, t_3, t_1$, maximum subsequence $=2$.
  3. $t_2, t_1, t_3$, maximum subsequence $=2$.
  4. $t_3, t_1, t_2$, maximum subsequence $=2$.
  5. $t_1, t_3, t_2$, maximum subsequence $=2$.
  6. $t_1, t_2, t_3$, maximum subsequence $=3$.
$$\boxed{\text{average score} = 2}$$

4 People.¶

There are 24 possibilities:

  1. $t_4, t_3, t_2, t_1$, maximum subsequence $=1$.
  2. $t_3, t_4, t_2, t_1$, maximum subsequence $=2$.
  3. $t_3, t_2, t_4, t_1$, maximum subsequence $=2$.
  4. $t_3, t_2, t_1, t_4$, maximum subsequence $=2$.
  5. $t_4, t_2, t_3, t_1$, maximum subsequence $=2$.
  6. $t_2, t_4, t_3, t_1$, maximum subsequence $=2$.
  7. $t_2, t_3, t_4, t_1$, maximum subsequence $=3$.
  8. $t_2, t_3, t_1, t_4$, maximum subsequence $=3$.
  9. $t_4, t_2, t_1, t_3$, maximum subsequence $=2$.
  10. $t_2, t_4, t_1, t_3$, maximum subsequence $=2$.
  11. $t_2, t_1, t_4, t_3$, maximum subsequence $=2$.
  12. $t_2, t_1, t_3, t_4$, maximum subsequence $=3$.
  13. $t_4, t_3, t_1, t_2$, maximum subsequence $=2$.
  14. $t_3, t_4, t_1, t_2$, maximum subsequence $=2$.
  15. $t_3, t_1, t_4, t_2$, maximum subsequence $=2$.
  16. $t_3, t_1, t_2, t_4$, maximum subsequence $=3$.
  17. $t_4, t_1, t_3, t_2$, maximum subsequence $=2$.
  18. $t_1, t_4, t_3, t_2$, maximum subsequence $=2$.
  19. $t_1, t_3, t_4, t_2$, maximum subsequence $=2$.
  20. $t_1, t_3, t_2, t_4$, maximum subsequence $=3$.
  21. $t_4, t_1, t_2, t_3$, maximum subsequence $=3$.
  22. $t_1, t_4, t_2, t_3$, maximum subsequence $=3$.
  23. $t_1, t_2, t_4, t_3$, maximum subsequence $=3$.
  24. $t_1, t_2, t_3, t_4$, maximum subsequence $=4$.

Answer¶

$$\boxed{\text{average score} = \frac{58}{24} \approx 2.417}$$

Extra Credit¶

Instead of four people, now suppose there are 10 people participating in the team building exercise. As before, they all write down different numbers, and then independently place their names at random positions on the line.

On average, what do you expect the team’s score to be?

Solution¶

Using $1 \le n \le 4$ from above, I noticed a few patterns. One way of looking at this problem is considering how adding a new team member (with the highest temperature preference, as stated above) creates a new sequence.

For any $n$:

  • $t_n, t_{n-1}, \ldots, t_2, t_1$, is the only subsequence of length $1$.
  • $t_1, t_2, \ldots, t_{n-1}, t_n$, is the only subsequence of length $n$.
  • Given any sequence containing $t_1, t_2, \ldots, t_{n-1}, t_n$, inserting $t_{n+1}$ will either keep the maximum subsequence the same or add 1 to it.
  • Given any sequence containing $t_1, t_2, \ldots, t_{n-1}, t_n$, inserting $t_{n+1}$ as the left most team member will always keep the maximum subsequence the same.
  • Given any sequence containing $t_1, t_2, \ldots, t_{n-1}, t_n$, inserting $t_{n+1}$ as the second left most team member will always keep the maximum subsequence the same. The only exception is $t_n, t_{n+1}, t_{n-1}, t_{n-2},\ldots, t_2, t_1$, which will change the maximum subsequence from 1 to 2.
  • Given any sequence containing $t_1, t_2, \ldots, t_{n-1}, t_n$, inserting $t_{n+1}$ as the right most team member will always increase the maximum subsequence by 1.

Let the average maximum subsequence for $n$ team members be $EV_n$.

As a result of the above, $EV_n \lt EV_{n+1} \lt 2\cdot EV_n$.

Let the total number of maximum subsequence increases be $SI_{n+1}$.

$$EV_{n+1} = EV_n + \frac{SI_{n+1}}{(n+1)!}$$

The number of maximum subsequence increases for $1 \le n \le 6$ is summarized below.

$n$ 1st 2nd 3rd 4th 5th 6th $SI_n$ $EV_n$
$1$ $0$ $1$ $\frac{1}{1}$
$2$ $0$ $1$ $1$ $\frac{3}{2}$
$3$ $0$ $1$ $2$ $3$ $\frac{12}{6}$
$4$ $0$ $1$ $3$ $6$ $10$ $\frac{58}{24}$
$5$ $0$ $1$ $5$ $15$ $24$ $45$ $\frac{335}{120}$
$6$ $0$ $1$ $8$ $40$ $75$ $120$ $251$ $\frac{2261}{720}$

$SI_n$ is A006220.

The numerator of $EV_n$ is A003316.

I wrote code that did the following :

  1. Create all permutations of $n$ team members lining up.
  2. For each permutation:
    1. Create a maximum subsequence list of length $n$. Initialize all elements as 1.
    2. LOOP 1 - For each team member from the second location in the line to the end :
      • LOOP 2 - For each team member from the first location in the line to that of LOOP 1 team member's location :
        1. Check if LOOP 1 team member's temperature preference is greater than that of LOOP 2 team member.
        2. If it is, update the maximum subsequence list index of LOOP 1 team member to the maximum of :
          • LOOP 1 team member's current maximum subsequence index.
          • 1 more than LOOP 2 team member's current maximum subsequence index.
    3. Save the largest maximum subsequence index value as the score.
  3. Sum all the scores and divide by $n!$.

Answer¶

For $10$ team members,

$$\boxed{\text{average score} = \frac{15,730,705}{10!} \approx 4.33496}$$

Rohan Lewis¶

2025.09.22¶

Code can be found here.