Minimum number of queries for an adaptive liar search game with small sets

DOI10.1016/j.disopt.2013.07.002zbMath1506.91032OpenAlexW2000599750MaRDI QIDQ1799380

Kun Meng, Chuang Lin, Yang Yang

Publication date: 18 October 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2013.07.002

zbMATH Keywords

small setsworst-casesequential algorithmsliar search games

Mathematics Subject Classification ID

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

Related Items

On the Rényi-Ulam game with restricted size queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum average-case queries of \(q+1\)-ary search game with small sets
• \(Q\)-ary Rényi-Ulam pathological liar game with one lie
• Ulam's searching game with two lies
• On separating systems whose elements are sets of at most k elements
• Searching with lies under error cost constraints
• Solution of Ulam's problem on searching with a lie
• Ulam's searching game with a fixed number of lies
• Optimal comparison strategies in Ulam's searching game with two errors
• Perfect two-fault tolerant search with minimum adaptiveness
• Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
• Searching with lies
• The liar game over an arbitrary channel
• \(Q\)-ary search with one Lie and bi-interval queries
• Minimal average cost of searching for a counterfeit coin: restricted model
• Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic
• On separating systems of a finite set
• Search with small sets in presence of a liar
• Searching games with errors -- fifty years of coping with liars