TY - JOUR T1 - When does a random Robin Hood win? JF - Theoretical Computer Science Y1 - 2003 A1 - Gasarch,William A1 - Golub,Evan A1 - Srinivasan, Aravind KW - Games KW - Randomized strategy KW - STRATEGY AB - A certain two-person infinite game (between “Robin Hood” and the “Sheriff”) has been studied in the context of set theory. In certain cases, it is known that for any deterministic strategy of Robin Hood's, if the Sheriff knows Robin Hood's strategy, he can adapt a winning counter-strategy. We show that in these cases, Robin Hood wins with “probability one” if he adopts a natural random strategy. We then characterize when this random strategy has the almost-surely winning property. We also explore the case of a random Sheriff versus a deterministic Robin Hood. VL - 304 SN - 0304-3975 UR - http://www.sciencedirect.com/science/article/pii/S0304397503002895 CP - 1–3 M3 - 10.1016/S0304-3975(03)00289-5 ER -