This is such a cool article, Professor! I love the idea of "randomness [playing] a cryptographic role of concealing information". Is there a way of quantifying the security of this source of randomness in a game of perfect information (when the opponent knows the random number generator strategy in addition to your strategy). I'm guessing that knowing your opponent is getting their random numbers from a quantum process does not give you any information on their next move because it is (from my understanding) a truly random process. However, as you mentioned, knowing that your opponent is using Tippett’s Random Sampling Numbers could give you much more information to predict their next move.
A bit of an aside, but I think the constraint of "zero-sum" is something that doesn't map onto human behvaior/social science. Is there clean/elegant theory on cooperative non-zero sum games?
This is such a cool article, Professor! I love the idea of "randomness [playing] a cryptographic role of concealing information". Is there a way of quantifying the security of this source of randomness in a game of perfect information (when the opponent knows the random number generator strategy in addition to your strategy). I'm guessing that knowing your opponent is getting their random numbers from a quantum process does not give you any information on their next move because it is (from my understanding) a truly random process. However, as you mentioned, knowing that your opponent is using Tippett’s Random Sampling Numbers could give you much more information to predict their next move.
A bit of an aside, but I think the constraint of "zero-sum" is something that doesn't map onto human behvaior/social science. Is there clean/elegant theory on cooperative non-zero sum games?