@article {17672,
	title = {When does a random Robin Hood win?},
	journal = {Theoretical Computer Science},
	volume = {304},
	year = {2003},
	month = {2003/07/28/},
	pages = {477 - 484},
	abstract = {A certain two-person infinite game (between {\textquotedblleft}Robin Hood{\textquotedblright} and the {\textquotedblleft}Sheriff{\textquotedblright}) has been studied in the context of set theory. In certain cases, it is known that for any deterministic strategy of Robin Hood{\textquoteright}s, if the Sheriff knows Robin Hood{\textquoteright}s strategy, he can adapt a winning counter-strategy. We show that in these cases, Robin Hood wins with {\textquotedblleft}probability one{\textquotedblright} 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.},
	keywords = {Games, Randomized strategy, STRATEGY},
	isbn = {0304-3975},
	doi = {10.1016/S0304-3975(03)00289-5},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397503002895},
	author = {Gasarch,William and Golub,Evan and Srinivasan, Aravind}
}
