Optimal strategies against a liar
From MaRDI portal
Publication:1978508
DOI10.1016/S0304-3975(99)00044-4zbMath0966.91014OpenAlexW1986419241MaRDI QIDQ1978508
Ugo Vaccaro, Ferdinando Cicalese
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00044-4
Related Items (10)
\(Q\)-ary search with one Lie and bi-interval queries ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Ulam's searching game with a fixed number of lies ⋮ Searching a Tree with Permanently Noisy Advice ⋮ 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 ⋮ 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
- Unnamed Item
- Unnamed Item
- Binary search with errors and variable cost queries
- Ulam's searching game with two lies
- Searching with a forbidden lie pattern in responses
- Coping with known patterns of lies in a search game
- Lie patterns in search procedures
- Solution of Ulam's problem on searching with a lie
- Prefix search with a lie
- Searching with known error probability
- Detecting errors in searching games
- Ulam's searching game with lies
- Weakly adaptive comparison searching
- Coping with errors in binary search procedures
- Ulam's searching game with a fixed number of lies
- Competitive group testing
- Searching with local constraints on error patterns
- Optimal comparison strategies in Ulam's searching game with two errors
- Ulam's searching game with three lies
- Searching with lies
- Comparison-based search in the presence of errors
This page was built for publication: Optimal strategies against a liar
