Strategies for the Renyi--Ulam game with fixed number of lies

DOI10.1016/j.tcs.2003.10.036zbMath1105.91301OpenAlexW2035253784MaRDI QIDQ1884914

Christian Deppe

Publication date: 27 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.036

zbMATH Keywords

Renyi--Ulam-GameSearching with lies

Mathematics Subject Classification ID

Search theory (90B40) Games in extensive form (91A18)

Related Items (1)

Perfect minimally adaptive \(q\)-ary search with unreliable tests

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
• Searching games with errors -- fifty years of coping with liars
• Least adaptive optimal search with unreliable tests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strategies for the Renyi--Ulam game with fixed number of lies