Playing by searching: Two strategies against a linearly bounded liar

DOI10.1016/S0304-3975(01)00071-8zbMath1019.91011MaRDI QIDQ1603717

Alberto Pedrotti

Publication date: 15 July 2002

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

zbMATH Keywords

gameerror ratesearching gamecomparison query

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Combinatorial games (91A46) Decision theory for games (91A35)

Related Items (2)

Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Searching games with errors -- fifty years of coping with liars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ulam's searching game with two lies
• Solution of Ulam's problem on searching with a lie
• Prefix search with a lie
• Searching with known error probability
• Coping with errors in binary search procedures
• Ulam's searching game with a fixed number of lies
• Solution of Ulam's problem on binary search with three lies
• Optimal comparison strategies in Ulam's searching game with two errors
• Three Thresholds for a Liar
• Computing with Noisy Information
• Comparison-based search in the presence of errors

This page was built for publication: Playing by searching: Two strategies against a linearly bounded liar