Perfect strategies for the Ulam-Rényi game with multi-interval questions

DOI10.1007/S00224-013-9487-7MaRDI QIDQ489747zbMATH OpenOpenAlexFDO

Authors Ferdinando Cicalese

Publication date 21 January 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-013-9487-7

zbMATH Keywords

errorssearchinginterval questionsperfect strategiesUlam-Rényi game

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial games (91A46)

Recommendations

• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
• Q-ary Ulam-Rényi game with constrained lies
• Q-Ary Ulam-Renyi Game with Constrained Lies
• Computing and Combinatorics
• Strategies for the Renyi--Ulam game with fixed number of lies

Cites work

• scientific article; zbMATH DE number 1577986 (Why is no real title available?)
• scientific article; zbMATH DE number 4047591 (Why is no real title available?)
• scientific article; zbMATH DE number 3547240 (Why is no real title available?)
• scientific article; zbMATH DE number 1932955 (Why is no real title available?)
• scientific article; zbMATH DE number 742943 (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?)
• Algorithms and Computation
• Binary search with errors and variable cost queries
• Coping with errors in binary search procedures
• Dealing with liars: misbehavior identification via Rényi-Ulam games
• Guess a Number-with Lying
• How to use expert advice
• Least adaptive optimal search with unreliable tests
• On searching strategies, parallel questions, and delayed answers
• Optimal comparison strategies in Ulam's searching game with two errors
• Perfect two-fault tolerant search with minimum adaptiveness
• Playing by searching: Two strategies against a linearly bounded liar
• Recent developments of feedback coding and its relations with many-valued logic
• Searching games with errors -- fifty years of coping with liars
• The Two-Batch Liar Game over an Arbitrary Channel
• The liar game over an arbitrary channel
• Three Thresholds for a Liar
• Two Batch Search With Lie Cost
• Ulam's searching game with a fixed number of lies

Cited in

(7)

• Ulam's searching game with a fixed number of lies
• Exhausting strategies, joker games and full completeness for IMLL with unit
• Computing and Combinatorics
• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
• An improved heuristic for the ``Ulam-Rényi game
• Q-ary Ulam-Rényi game with constrained lies
• Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies

This page was built for publication: Perfect strategies for the Ulam-Rényi game with multi-interval questions

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