Ulam's searching game with two lies
From MaRDI portal
Publication:749204
DOI10.1016/0097-3165(90)90002-EzbMath0712.68027MaRDI QIDQ749204
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items (20)
Strategies for the Renyi--Ulam game with fixed number of lies ⋮ \(Q\)-ary search with one Lie and bi-interval queries ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Detecting errors in searching games ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Correcting a single error in feedback channels ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Optimal strategies against a liar ⋮ Ulam's searching game with a fixed number of lies ⋮ Searching games with errors -- fifty years of coping with liars ⋮ 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 ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Ulam's searching game with three lies ⋮ Searching with a forbidden lie pattern in responses ⋮ Group testing with unreliable tests ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ Playing by searching: Two strategies against a linearly bounded liar ⋮ An improved heuristic for the ``Ulam-Rényi game
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of Ulam's problem on searching with a lie
- Solution of Ulam's problem on binary search with two lies
- Searching with known error probability
- Detecting errors in searching games
- Ulam's searching game with lies
- Coping with errors in binary search procedures
- Guess a Number-with Lying
This page was built for publication: Ulam's searching game with two lies
