Minimum average-case queries of q+1-ary search game with small sets

DOI10.1016/J.DAM.2011.10.030zbMATH Open1237.91063OpenAlexW2003386477MaRDI QIDQ412374FDOQ412374

Authors: Kun Meng, Chuang Lin, Wen An Liu, Yang Yang, Gyula O. H. Katona 

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.030

Recommendations

• Minimum number of queries for an adaptive liar search game with small sets
• \(Q\)-ary search with one Lie and bi-interval queries
• Algorithms and Computation
• scientific article; zbMATH DE number 638691
• Optimal strategies against a liar

zbMATH Keywords

average-costHuffman treesearch gamesequential algorithm

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Cites Work

• Searching with lies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two counterfeit coins
• How to find many counterfeit coins?
• Five counterfeit coins
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• Optimal detection of two counterfeit coins with two-arms balance.
• Optimal detection of a counterfeit coin with multi-arms balances
• Minimal average cost of searching for a counterfeit coin: restricted model
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• On separating systems whose elements are sets of at most k elements

Cited In (2)

• Minimum number of queries for an adaptive liar search game with small sets
• Disjoint spread systems and fault location

This page was built for publication: Minimum average-case queries of \(q+1\)-ary search game with small sets

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