## Abstract

We consider the guessing secrets problem defined by Chung et al. [2001]. This is a variant of the standard 20 questions game where the player has a set of k > 1 secrets from a universe of N possible secrets. The player is asked Boolean questions about the secret. For each question, the player picks one of the k secrets adversarially, and answers according to this secret. We present an explicit set of O(log N) questions together with an efficient (i.e., poly(log N) time) algorithm to solve the guessing secrets problem for the case of 2 secrets. This answers the main algorithmic question left unanswered by Chung et al. [2001]. The main techniques we use are small ε-biased spaces and the notion of list decoding.

Original language | English (US) |
---|---|

Article number | 1290679 |

Journal | ACM Transactions on Algorithms |

Volume | 3 |

Issue number | 4 |

DOIs | |

State | Published - Nov 1 2007 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Mathematics (miscellaneous)

## Keywords

- 20 questions
- Biased spaces
- Decoding algorithms
- Error-correcting codes
- K-universal sets