Prefix search with a lie

DOI10.1016/0097-3165(88)90003-9zbMath0644.68089OpenAlexW2020823718MaRDI QIDQ1102755

Andrzej Pelc

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(88)90003-9

zbMATH Keywords

full binary tree

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Binary search with errors and variable cost queries ⋮ Optimal strategies against a liar ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Group testing with unreliable tests ⋮ Playing by searching: Two strategies against a linearly bounded liar

Cites Work

• Unnamed Item
• Coping with known patterns of lies in a search game
• Solution of Ulam's problem on searching with a lie
• Coping with errors in binary search procedures
• Guess a Number-with Lying