Playing Guess Who with your kids: code-word strategy against adversaries

DOI10.1016/J.TCS.2024.114766MaRDI QIDQ6614014zbMATH OpenFDO

Authors Ami Paz, Liat Peterfreund

Publication date 7 October 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114766

zbMATH Keywords

erasure codeserror correcting codesbinary searchGuess Who?Rényi-Ulam games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3547240 (Why is no real title available?)
• scientific article; zbMATH DE number 3559318 (Why is no real title available?)
• scientific article; zbMATH DE number 3205803 (Why is no real title available?)
• scientific article; zbMATH DE number 3282350 (Why is no real title available?)
• A framework for searching in graphs in the presence of errors
• Delayed binary search, or playing twenty questions with a procrastinator
• Efficient solutions for mastermind using genetic algorithms
• Introduction to Coding Theory
• Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
• Mastermind
• Navigating in Trees with Permanently Noisy Advice
• OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH
• On Databases with Incomplete Information
• Query complexity of mastermind variants
• Searching games with errors -- fifty years of coping with liars
• 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 two lies

Cited in

(1)

• Twenty questions with random error

This page was built for publication: Playing Guess Who with your kids: code-word strategy against adversaries

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