On partial information retrieval: the unconstrained 100 prisoner problem

by   Ivano Lodato, et al.

We consider the classical 100 Prisoner problem and its variant, involving empty boxes, introduced by Gal and Miltersen. Unlike previous studies, here we focus on the winning probabilities for an arbitrary number of winners and attempts, which we call the unconstrained problem. We introduce general classes of strategies, applicable to different settings and quantify how efficient they are. We make use of Monte Carlo simulations, whenever analytic results are not available, to estimate with high accuracy the probabilities of winning. Finally, we also comment on the possible applications of our results in understanding processes of information retrieval, such as "memory" in living organisms.



page 9

page 13

page 17

page 20

page 23

page 24

page 26

page 29


The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns

We study the private information retrieval (PIR) problem under arbitrary...

On-The-Fly Information Retrieval Augmentation for Language Models

Here we experiment with the use of information retrieval as an augmentat...

Staircase-PIR: Universally Robust Private Information Retrieval

We consider the problem of designing private information retrieval (PIR)...

Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval

We consider the problem of noisy private information retrieval (NPIR) fr...

Patapasco: A Python Framework for Cross-Language Information Retrieval Experiments

While there are high-quality software frameworks for information retriev...

A hypergeometric test interpretation of a common tf-idf variant

Term frequency-inverse document frequency, or tf-idf for short, is a num...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.