Random strategies with memory for the Robin Hood game

Details Random strategies with memory for the Robin Hood game Random strategies with memory for the Robin Hood game

2004-01-14

arxiv.org/abs/math/0401154v4

Foundations of the Formal Sciences V: Infinite Games (S. Bold, B. Loewe, T. Raesch, J. van Benthem, eds.), Studies in Logic 11

Mathematics

Combinatorics

Small updates

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Random strategies with memory for the Robin Hood game does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random strategies with memory for the Robin Hood game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random strategies with memory for the Robin Hood game will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-634402