Ulam's searching game with three lies

DOI10.1016/0196-8858(92)90019-SzbMath0773.68022MaRDI QIDQ1802349

Matteo Sereno, Alberto Negro

Publication date: 21 July 1993

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

yes-no queriesUlam's searching game

Mathematics Subject Classification ID

Searching and sorting (68P10) 2-person games (91A05)

Related Items (11)

\(Q\)-ary search with one Lie and bi-interval queries ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Optimal strategies against a liar ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice ⋮ Group testing with unreliable tests ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Perfect two-fault tolerant search with minimum adaptiveness ⋮ An improved heuristic for the ``Ulam-Rényi game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ulam's searching game with two lies
• Solution of Ulam's problem on searching with a lie
• Solution of Ulam's problem on binary search with two lies
• Ulam's searching game with lies
• Coping with errors in binary search procedures
• Solution of Ulam's problem on binary search with three lies

This page was built for publication: Ulam's searching game with three lies