The Rényi-Ulam pathological liar game with a fixed number of lies

DOI10.1016/j.jcta.2005.02.003zbMath1121.91023arXivmath/0407504OpenAlexW2166252189MaRDI QIDQ2575810

Robert B. Ellis, Vadim Ponomarenko, Catherine Huafei Yan

Publication date: 6 December 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0407504

zbMATH Keywords

searching with liessphere bound

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorial games (91A46) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

\(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ How to play the one-lie Rényi-Ulam game ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ Two-batch liar games on a general bounded channel

Cites Work

• Ulam's searching game with two lies
• Solution of Ulam's problem on searching with a lie
• Ulam's searching game with a fixed number of lies
• 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 games with errors -- fifty years of coping with liars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Rényi-Ulam pathological liar game with a fixed number of lies