The Thue-Morse sequence isn't a solution when $n=8$, but it gets close. Here are the fairest sequences with $v_0\ge v_1$ for small $n = $ $1,$ $2,$ $\dots,$ $11$, according to an exhaustive brute-force search, where $v_b$ denotes the expected score for the player choosing when the binary digit is $b$.
$$\begin{array}{rcccc} n&\text{fairest with }v_0\ge v_1&v_0&v_1&v_0-v_1\\ \hline 2&10&5/3&3/2&1/6\\ 3&001&5/2&7/3&1/6\\ 4&0110&10/3&16/5&2/15\\ 5&11010&62/15&33/8&1/120\\ \\ 6&000011&5&5&0\\ &001110&5&5&0\\ &110001&5&5&0\\ &111100&5&5&0\\ \\ 7&1000101&377/64&88/15&23/960\\ \\ 8&00110110&61/9&27/4&1/36\\ &10000011&61/9&27/4&1/36\\ &10001110&61/9&27/4&1/36\\ &10110001&61/9&27/4&1/36\\ &10111100&61/9&27/4&1/36\\ &11110010&61/9&27/4&1/36\\ \\ 9&011000101&245/32&574/75&7/2400\\ \\ 10&0100110110&77/9&94/11&1/99\\ &0110000011&77/9&94/11&1/99\\ &0110001110&77/9&94/11&1/99\\ &0110110001&77/9&94/11&1/99\\ &0110111100&77/9&94/11&1/99\\ &0111110010&77/9&94/11&1/99\\ \\ 11&00101101001&3309/350&8417/891&2369/311850\\ \end{array}$$
Source code (in need of optimisation) in GP/PARI:
f(s,b) = { if(#s==1, s[1],
if(b%2, sum(i=1,#s,f(setminus(s,[s[i]]),b\2))/#s,
f(vecextract(s,"2.."),b\2)
))
};
g(n) = { d0 = n+1; s = vector(n+1,i,2^(i-1));
for(b = 0, 2^(n-1)-1,
v0 = f(s,b); v1 = f(s, 2^n-1-b);
if(d0 >= abs(v0-v1), d0 = abs(v0-v1); b0 = b;
print(binary(b0)," ",v0," ",v1," ",d0)
))
};
g(11);