Ulam's searching game with three lies

DOI10.1016/0196-8858(92)90019-SMaRDI QIDQ1802349zbMATH OpenFDO

Authors Alberto Negro, Matteo Sereno

Publication date 21 July 1993

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-8858(92)90019-S

zbMATH Keywords

Ulam's searching gameyes-no queries

Mathematics Subject Classification ID

Searching and sorting (68P10) 2-person games (91A05)

Cites work

• Coping with errors in binary search procedures
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 3547240 (Why is no real title available?)
• scientific article; zbMATH DE number 3282350 (Why is no real title available?)
• Solution of Ulam's problem on binary search with three lies
• Solution of Ulam's problem on binary search with two lies
• Solution of Ulam's problem on searching with a lie
• Ulam's searching game with lies
• Ulam's searching game with two lies

Cited in

(12)

• Solution of Ulam's problem on binary search with three lies
• Group testing with unreliable tests
• Perfect two-fault tolerant search with minimum adaptiveness
• An improved heuristic for the ``Ulam-Rényi game
• Optimal strategies against a liar
• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
• \(Q\)-ary search with one Lie and bi-interval queries
• Perfect minimally adaptive \(q\)-ary search with unreliable tests
• Searching for a counterfeit coin with two unreliable weighings
• 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

This page was built for publication: Ulam's searching game with three lies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802349)