I really am curious about the Nash equilibrium solution. I assume that as a commenter has mentioned, for the guesser it involves returning random numbers near the binary search. But I’m curious if for the picker it involves a uniform or non uniform initial distribution?? I’m sure someone on HN knows/can explain?
There's obviously a huge gap between the 5-number game and the 100-number game; it's possible that the best mixed strategies settle down as the number of choices gets larger, or (for all I know) it's possible that the best mixed strategies get crazier and crazier. I'd love a ping if anyone does any real exploration of the 6-, 7-, etc.-number games.
"Candidate always starts by guessing 50" can't possibly be part of a Nash equilibrium, since then Ballmer would never ever choose 50 as his secret number. (And indeed, he says as much in the linked video.) And if he'll never choose 50, then it's obviously silly for the candidate to waste a guess on it... and so on. Nash equilibria are usually (always?) located at mixed strategies.
