Optimality conjecture for the Oldest random strategy in the Robin Hood game

From papers

Let RH(r,s,A)RH(r,s,A) be a Robin Hood game with resource functions r,sr,s and index set AA. A random strategy is independent of the index set AA if its choices do not depend on AA. Oldest random strategy optimality conjecture. The strategy OldestRND\mathsf{Oldest}_{\mathit{RND}} is the best random strategy among the strategies that are independent of AA. The source presents this as one of its principal open problems; no resolution is given.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Boaz Tsaban, “Random strategies with memory for the Robin Hood game”, arXiv:math/0401154 (2007).

Solutions 0

No solutions have been posted yet.