Timeline for Painting $n$ balls from $2n$ balls red, and guessing which ball is red, game
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2014 at 15:39 | history | edited | usul | CC BY-SA 3.0 |
added 179 characters in body
|
| Oct 23, 2014 at 15:37 | comment | added | usul | You're right, I was treating $k$ as the maximum number of boxes, not the expected. | |
| Oct 23, 2014 at 4:31 | comment | added | Irvan | But $k$ is not equal to the expected number of boxes opened, right? I mean, if Lucy decides to distribute the balls uniformly, then even if we set $k = n$ (which means, we open every box), then the expected number of boxes opened would be $O(1)$. The main difficulty I've encountered while trying to solve this problem is to find a distribution that guarantees that the expected number of boxes opened by Alice is large conditioned that Alice would like to succeed with probability at least $1/n$. | |
| Oct 23, 2014 at 3:49 | history | edited | usul | CC BY-SA 3.0 |
added 233 characters in body
|
| Oct 22, 2014 at 17:53 | history | answered | usul | CC BY-SA 3.0 |