Coping with known patterns of lies in a search game

DOI10.1016/0304-3975(84)90104-XzbMath0544.90105MaRDI QIDQ797505

K. B. Lakshmanan, Bala Ravikumar

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

average-case analysisknown patterns of liestwo-person search game

Mathematics Subject Classification ID

2-person games (91A05)

Related Items

Binary search with errors and variable cost queries ⋮ 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 ⋮ Optimal strategies against a liar ⋮ An algorithm for ``Ulam's Game and its application to error correcting codes ⋮ The infinite duration lying oracle game ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Searching with a forbidden lie pattern in responses ⋮ Group testing with unreliable tests ⋮ An improved heuristic for the ``Ulam-Rényi game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coping with errors in binary search procedures
• The game of \(N\) questions of a tree
• Performance bounds on the splitting algorithm for binary testing
• A Counting Approach to Lower Bounds for Selection Problems