6 problems

Consider a ship moving at constant speed in a half-plane ocean whose straight shoreline has unknown distance and direction from the ship. In the min-max interpretation of optimalit…

Consider a searcher in the entire plane looking for a target whose distance and direction are unknown. A search strategy or path is evaluated by the distance or search cost require…

Let there be multiple moving and possibly camouflaging targets, with the search problem formulated using an objective function such as the expected number of unique targets detecte…

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…