Q-ary search with one Lie and bi-interval queries

DOI10.1016/J.IPL.2007.03.003MaRDI QIDQ2379948zbMATH OpenOpenAlexFDO

Authors Wen An Liu, Kun Meng, Shu Min Xing

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.03.003

zbMATH Keywords

fault toleranceworst-case\(q\)-ary searchbi-interval queries

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05)

Recommendations

• Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
• Optimal strategies against a liar
• \(Q\)-ary Rényi-Ulam pathological liar game with one lie
• scientific article; zbMATH DE number 638691
• Minimum number of queries for an adaptive liar search game with small sets

Cites work

• scientific article; zbMATH DE number 1577986 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 638691 (Why is no real title available?)
• scientific article; zbMATH DE number 782050 (Why is no real title available?)
• scientific article; zbMATH DE number 4185611 (Why is no real title available?)
• Optimal comparison strategies in Ulam's searching game with two errors
• Optimal strategies against a liar
• Searching for a counterfeit coin with two unreliable weighings
• Searching games with errors -- fifty years of coping with liars
• Searching with lies
• 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
• Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
• Ulam's searching game with a fixed number of lies
• Ulam's searching game with lies
• Ulam's searching game with three lies
• Ulam's searching game with two lies

Cited in

(4)

• Minimum average-case queries of \(q+1\)-ary search game with small sets
• The 1-Versus-2 Queries Problem Revisited
• Minimum number of queries for an adaptive liar search game with small sets
• Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies

This page was built for publication: \(Q\)-ary search with one Lie and bi-interval queries

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