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 …

Sorting is a fundamental problem in computer science. In the classical setting, it is well-
known that (1±o (1)) n log2 n comparisons are both necessary and sufficient to sort a list of n …

We study a noisy version of the classic binary search problem of inserting an element into its
proper place within an ordered sequence by comparing it with elements of the sequence. In …

This paper studies a generalization of the classic binary search problem of locating a
desired value within a sorted list. The classic problem can be viewed as determining the …

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 …

We address the problem of identifying and isolating misbehaving nodes that refuse to
forward packets in multi-hop ad hoc networks. We develop a comprehensive system called …

We use a Bayesian approach to optimally solve problems in noisy binary search. We deal
with two variants: 1. Each comparison is erroneous with independent probability 1-p. 2. At …

This paper investigates the problem of determining a binary-valued function through a
sequence of strategically selected queries. The focus is an algorithm called Generalized …

We consider the following natural generalization of Binary Search: in a given undirected,
positively weighted graph, one vertex is a target. The algorithm's task is to identify the target …

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 …