My searching has come up with, at best, this question:
What's the fairest turn sequence for n players?
which as far as I can tell does not answer my question.
I have a game with 6 players - let's call them A, B, C, D, E and F. My goal is to create a sequence of turns such that over a long enough period, each player would play after each one of the other players the same number of times. In other words, for player A the subsequences BA, CA, DA, EA and FA should appear an equal number of times.
It is also important that each player gets an equal number of turns, and that they never have to wait too long between turns. I suspect both of these will be required anyway for a good solution, but I might as well mention them.
Double turns (e.g. ABCCB) are not allowed.
The "first player advantage" topic (discussed in the other question I linked to) is of a lesser concern, but if it's possible to integrate it into a solution it wouldn't hurt.
How do mathematicians approach this type of problem?