\(Q\)-ary Rényi-Ulam pathological liar game with one lie

DOI10.1016/j.dam.2010.12.021zbMath1211.91087OpenAlexW2095589306MaRDI QIDQ628343

Chuang Lin, Wen An Liu, Kun Meng, Yang Yang

Publication date: 10 March 2011

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

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

zbMATH Keywords

characterstateworst casepathological liar gameRenyi-Ulam game

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ulam's searching game 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 pathological liar game with one half-lie
• Searching with lies
• Optimal strategies against a liar
• Searching for a counterfeit coin with two unreliable weighings
• The Rényi-Ulam pathological liar game with a fixed number of lies
• Searching games with errors -- fifty years of coping with liars