All or Nothing Caching Games with Bounded Queries

Abstract

We determine the value of some search games where our goal is to find all of some hidden treasures using queries of bounded size. The answer to a query is either empty, in which case we lose, or a location, which contains a treasure. We prove that if we need to find [Formula: see text] treasures at [Formula: see text] possible locations with queries of size at most [Formula: see text], then our chance of winning is [Formula: see text] if each treasure is at a different location and [Formula: see text] if each location might hide several treasures for large enough [Formula: see text]. Our work builds on some results by Csóka who has studied a continuous version of this problem, known as Alpern’s Caching Game we also prove that the value of Alpern’s Caching Game is [Formula: see text] for integer [Formula: see text] and large enough [Formula: see text].