This is a survey on searching with errors, considered in the framework of two-person games.
The Responder thinks of an object in the search space, and the Questioner has to find it by …

Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …

The study of the effect that errors may have on computation started at the very beginning of
the history of computer science. It dates back to the early 1950s, to the research by von …

Given a teacher that holds a function f: X→ R from some class of functions C. The teacher
can receive from the learner an element d in the domain X (a query) and returns the value of …

Ulam and Rényi asked what is the minimum number of yes-no questions needed to find an
unknown m-bit number x, if up to l of the answers may be erroneous/mendacious. For each l …

This paper gives a broad overview of the area of searching with errors and the related field
of error-correcting coding. In the vast literature regarding this problem, many papers …

Our aim is to minimize the number of answer/question alternations in a perfect two-fault-
tolerant search. Ulam and Rényi posed the problem of searching for an unknown m-bit …

We consider the basic problem of searching for an unknown m-bit number by asking the
minimum possible number of yes–no questions, when up to a finite number e of the answers …

In their paper [43] Rota and Metropolis considered the partially ordered set F n of all
nonempty faces of the n-cube [0, 1] n for each n= 1, 2,…, equipped with the following …

The Rényi–Berlekamp–Ulam game is a classical model for the problem of determining the
minimum number of queries to find an unknown member in a finite set when up to a finite …