All Questions

Nate has $n \geq 2$ coins $\{C_i\}_{0 \leq i \leq n-1}$ that each turn up heads with probability $\frac{i}{n-1}$ each, but he is not sure which ones are which. He has \$1 with which to bet with. On ...

$N \geq 2$ players play a game - at the start of the game, they are each given independently and uniformly a number from $[0, 1]$. On each round, they are to guess whether their number is higher or ...

Consider the following game - I draw a number from $[0, 1]$ uniformly, and show it to you. I tell you I am going to draw another $1000$ numbers in sequence, independently and uniformly. Your task is ...

$N \geq 2$ players play a cooperative game on the integers $\mathbb Z$. All of them start from $0$. At each turn, they are simultanously given the same yes or no question to answer. The questions ...