Ulam's searching game with lies

DOI10.1016/0097-3165(89)90062-9zbMath0674.90110OpenAlexW2011308746MaRDI QIDQ1121815

Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0097-3165(89)90062-9

zbMATH Keywords

minimal number of yes-no queriesunknown integer

Mathematics Subject Classification ID

Game theory (91A99)

Related Items

Logic of infinite quantum systems, \(Q\)-ary search with one Lie and bi-interval queries, A nonadaptive version of Ulam's problem with one lie, A problem of minimax estimation with directional information, Optimal comparison strategies in Ulam's searching game with two errors, Nonadaptive search problem with sets of equal sum, Perfect minimally adaptive \(q\)-ary search with unreliable tests, Optimal strategies against a liar, Ulam's searching game with a fixed number of lies, Solution of Ulam's problem on binary search with three lies, Searching with lies: The Ulam problem, The Algebras of Łukasiewicz Many-Valued Logic: A Historical Overview, Searching games with errors -- fifty years of coping with liars, Least adaptive optimal search with unreliable tests, Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies, Two cooperative versions of the guessing secrets problem, On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice, Agnostic active learning, Ulam's searching game with three lies, Ulam's searching game with two lies, Searching with a forbidden lie pattern in responses, Group testing with unreliable tests, Perfect two-fault tolerant search with minimum adaptiveness, An improved heuristic for the ``Ulam-Rényi game

Cites Work

• Unnamed Item
• Unnamed Item
• Solution of Ulam's problem on searching with a lie
• Solution of Ulam's problem on binary search with two lies
• Coping with errors in binary search procedures
• Guess a Number-with Lying