Random strategies with memory for the Robin Hood game

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


The_Robin_Hood_ game is played as follows: On day i, the Sheriff puts s(i) bags of gold in the cave. On night i, Robin removes r(i) bags from the cave. The game is played for each natural nymber i. Robin wins if each bag which was put in the cave is eventually removed from it; otherwise the Sheriff wins. Gasarch, Golub, and Srinivasan studied the Robin Hood game in the case of random strategies where Robin has no historical memory. We extend their main result to the case of bounded historical memory, and obtain a hierarchy of provably distinct games.
Original languageAmerican English
Title of host publicationFoundations of the Formal Sciences V: Infinite Games‏
EditorsS. Bold, B. Loewe, T. Raesch, J. van Benthem
Place of PublicationLondon
PublisherCollege Publications
StatePublished - 2007


Dive into the research topics of 'Random strategies with memory for the Robin Hood game'. Together they form a unique fingerprint.

Cite this