bounded queries
Recently Published Documents


TOTAL DOCUMENTS

22
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

2018 ◽  
Vol 20 (01) ◽  
pp. 1750023
Author(s):  
Dömötör Pálvölgyi

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].



2013 ◽  
Vol 25 (11) ◽  
pp. 2448-2462 ◽  
Author(s):  
Manish Bhide ◽  
Krithi Ramamritham






2003 ◽  
pp. 161-195 ◽  
Author(s):  
William Gasarch
Keyword(s):  






Sign in / Sign up

Export Citation Format

Share Document