Searching with known error probability
Theoretical Computer Science
Searching in the presence of linearly bounded errors
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line learning of rectangles in noisy environments
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On optimal strategies for searching in presence of errors
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Playing twenty questions with a procrastinator
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
Least adaptive optimal search with unreliable tests
Theoretical Computer Science
Playing by searching: two strategies against a linearly bounded liar
Theoretical Computer Science
Least Adaptive Optimal Search with Unreliable Tests
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
coping with Delays and Time-Outs in Binary Search Procedures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Security of Public Watermarking Schemes for Binary Sequences
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Noisy binary search and its applications
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Experimental study of resilient algorithms and data structures
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Designing reliable algorithms in unreliable memories
Computer Science Review
The multi-interval ulam-rényi game
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 0.00 |
Motivated by the problem of searching in the presence of adversarial errors, we consider a version of the game “Twenty Questions” played on the set {0,…,N-1} where the player giving answers may lie in her answers. The questioner is allowed Q questions and the responder may lie in upto [rQ] of the answers, for some fixed and previously known fraction r. Under three different models of this game and for two different question classes, we give precise conditions (i.e. tight bounds on r and, in most cases, optimal bounds on Q under which the questioner has a winning strategy in the game.