Uthaipon Tantipongpipat

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper proves an optimal strategy for Ebert’s hat game with three players and more than two hat colors. In general, for n players and k hat colours, we construct a strategy that is asymptotically optimal as k →∞. Computer calculation for particular values of n and k suggests that, as long as n is linear with k, the strategy is asymptotically optimal. We(More)
  • 1