Optimal strategies against a liar
From MaRDI portal
DOI10.1016/S0304-3975(99)00044-4zbMATH Open0966.91014OpenAlexW1986419241MaRDI QIDQ1978508FDOQ1978508
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
Cites Work
- Solution of Ulam's problem on searching with a lie
- Coping with errors in binary search procedures
- Searching with lies
- Title not available (Why is that?)
- Prefix search with a lie
- Searching with known error probability
- Ulam's searching game with a fixed number of lies
- Competitive group testing
- Binary search with errors and variable cost queries
- Title not available (Why is that?)
- Coping with known patterns of lies in a search game
- Title not available (Why is that?)
- Comparison-based search in the presence of errors
- Optimal comparison strategies in Ulam's searching game with two errors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ulam's searching game with two lies
- Detecting errors in searching games
- Ulam's searching game with lies
- Lie patterns in search procedures
- Searching with a forbidden lie pattern in responses
- Weakly adaptive comparison searching
- Ulam's searching game with three lies
- Searching with local constraints on error patterns
Cited In (18)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests
- An improved heuristic for the ``Ulam-Rényi game
- Search with small sets in presence of a liar
- Searching games with errors -- fifty years of coping with liars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ulam's searching game with a fixed number of lies
- The halflie problem.
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie
- Searching a Tree with Permanently Noisy Advice
- Least adaptive optimal search with unreliable tests
- \(Q\)-ary search with one Lie and bi-interval queries
- Ulam's liar problem
- Strategies for the Renyi--Ulam game with fixed number of lies
- Perfect two-fault tolerant search with minimum adaptiveness
- Playing by searching: Two strategies against a linearly bounded liar
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
Recommendations
This page was built for publication: Optimal strategies against a liar
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978508)
