Optimal comparison strategies in Ulam's searching game with two errors

DOI10.1016/S0304-3975(97)00030-3zbMath0902.90191MaRDI QIDQ1391131

Alberto Trombetta, Daniele Mundici

Publication date: 22 July 1998

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

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items

\(Q\)-ary search with one Lie and bi-interval queries ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games ⋮ Optimal strategies against a liar ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Resolution and model building in the infinite-valued calculus of Łukasiewicz ⋮ Perfect two-fault tolerant search with minimum adaptiveness ⋮ Playing by searching: Two strategies against a linearly bounded liar

Cites Work

• Unnamed Item
• Unnamed Item
• Solution of Ulam's problem on searching with a lie
• Ulam's searching game with lies
• Ulam's searching game with a fixed number of lies
• Logic of infinite quantum systems