Noisy binary search and its applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 881-890

  Karp, Richard M ^a   Kleinberg, Robert ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; INVESTMENTS; QUEUEING NETWORKS;

BINARY SEARCH; COLLEGE ADMISSIONS; INVESTMENT PLANNING; ITS APPLICATIONS; NOISY VERSIONS; ON-LINE ALGORITHMS; SPONSORED SEARCHES; TARGET VALUES;

ALGORITHMS;

EID: 84969199624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Noga Alon, Joel H. Spencer, and Paul Erdós. The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, Inc., New York, 1992.
2. J. Aslam and A. Dhagat. Searching in the presence of linearly bounded errors. In Proc. ACM Symposium on the Theory of Computing (STOC), pages 486-493, 1991.
3. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., New York, 1991.
4. A. Dhagat, P. Gacs, and P. Winkler. On playing "twenty questions" with a liar. In Proc. ACM Symposium on Discrete Algorithms (SODA), pages 16-22, 1992.
5. Robert Kleinberg and Tom Leighton. The value of knowing a demand curve: Bounds on regret for postedprice auctions. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 594-605, 2003.
6. A. Pelc. Searching with known error probability. Theoretical Computer Science, 63:185-202, 1989.
7. R.L. Rivest, A.R. Meyer, D.J. Kleitman, K. Winklmann, and J. Spencer. Coping with errors in binary search procedures. Journal of Computer and System Sciences, 20:396-404, 1980.
8. R.S. Borgstrom snd S.R. Kosaraju. Comparison-based search in the prsence of errors. In Proc. ACM Symposium on the Theory of Computing (STOC), pages 130-136, 1993.
9. J. Spencer. Ulam's searching game with a fixed number of lies. Theoretical Computer Science, 95:307-321, 1992.