>>725
Stanford大学教授 時枝正
「第k列のD番目の箱に入った実数はS^k(D)=r(D)と賭ければ,めでたく確率99/100で勝てる.確率1-εで勝てることも明らかであろう.」
数学セミナー201511月号「箱入り無数目」

Kusiel-Vorreuter大学教授 Sergiu Hart
「For every ε>0 Player 2 has a mixed strategy in game1 guaranteeing him a win with probability at least 1-ε.」
http://www.ma.huji.ac.il/hart/puzzle/choice.pdf?

Baylor大学教授 Alexander Pruss
「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.」
Alexander Pruss Dec 19, 2013 at 15:05
https://mathoverflow.net/questions/151286/probabilities-in-a-riddle-involving-axiom-of-choice

>吐くように嘘をつく
だね、君が