4 problems

Let $v_A(n,d,k)$ be the value of Alpern's Caching Game, and let Theorem denote the paper's theorem for the Multiple Caching Game. The $n=dk-1$ extension conjecture. The weak Csóka…

Let $v_A(n,d,k)$ denote the value of Alpern's Caching Game with $n$ doors, $d$ treasures, and searcher power $k$. Csóka's conjecture. If $k\geq 1+\frac{2}{d-1}$ and $n\geq dk$, the…

Let $v_A(n,d,k)$ denote the value of Alpern's Caching Game with $n$ doors, $d$ treasures, and searcher power $k$. Csóka's conjecture. If $k$ is an integer and $n\geq dk$, then … Th…

Consider a caching game in which a Hider places objects in locations and a Searcher adaptively searches for them. After the Searcher finds the first object, the remaining objects i…