Optimal strategies against a liar
From MaRDI portal
Publication:1978508
DOI10.1016/S0304-3975(99)00044-4zbMath0966.91014MaRDI QIDQ1978508
Ferdinando Cicalese, Ugo Vaccaro
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Searching games with errors -- fifty years of coping with liars, Least adaptive optimal search with unreliable tests, \(Q\)-ary Rényi-Ulam pathological liar game with one lie, Perfect two-fault tolerant search with minimum adaptiveness, An improved heuristic for the ``Ulam-Rényi game, \(Q\)-ary search with one Lie and bi-interval queries, Perfect minimally adaptive \(q\)-ary search with unreliable tests
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
