20/07/26 14:00:17.78 9ZaudBKU.net
>>240
URLﾘﾝｸ(mathoverflow.net)
What we have then is this: For each fixed opponent strategy, if i is chosen uniformly independently of that strategy (where the "independently" here
isn't in the probabilistic sense), we win with probability at least (n-1)/n. That's right. But now the question is whether we can translate this to
a statement without the conditional "For each fixed opponent strategy". ? Alexander Pruss Dec 19 '13 at 15:05
How about describing the riddle as this game, where we have to first explicit our strategy, then an opponent can choose any sequence. then it is
obvious than our strategy cannot depend on the sequence. The riddle is "find how to win this game with proba (n-1)/n, for any n." ? Denis Dec 19 '13 at 19:43
But the opponent can win by foreseeing what which value of i we're going to choose and which choice of representatives we'll make. I suppose we would
ban foresight of i? ? Alexander Pruss Dec 19 '13 at 21:25