Paper detail

Random strategies with memory for the Robin Hood game

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.

preprint2007arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.