Perfect strategies for the Ulam-Rényi game with multi-interval questions
From MaRDI portal
Publication:489747
DOI10.1007/s00224-013-9487-7zbMath1303.68044OpenAlexW1975078504MaRDI QIDQ489747
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
Related Items (2)
Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary search with errors and variable cost queries
- Coping with errors in binary search procedures
- Ulam's searching game with a fixed number of lies
- 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
- On searching strategies, parallel questions, and delayed answers
- The liar game over an arbitrary channel
- Guess a Number-with Lying
- Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games
- Three Thresholds for a Liar
- How to use expert advice
- Two Batch Search With Lie Cost
- Algorithms and Computation
- Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic
- The Two-Batch Liar Game over an Arbitrary Channel
- Searching games with errors -- fifty years of coping with liars
- Least adaptive optimal search with unreliable tests
This page was built for publication: Perfect strategies for the Ulam-Rényi game with multi-interval questions
