Optimal strategies against a liar

Theoretical Computer Science

Volumn 230, Issue 1-2, 2000, Pages 167-193

  Cicalese, Ferdinando ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000324989     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00044-4     Document Type: Article

References (29)

1. J.A. Aslam, A. Dhagat, Searching in the presence of linearly bounded errors, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing New Orleans, Louisiana, 6-8 May 1991, pp. 486-493.
2. M. Aigner, Searching with lies, J. Combin. Theory Ser. A 74 (1995) 43-56.
3. R.S. Borgstrom, S. Rao Kosaraju, Comparison-based search in the presence of errors, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, California, 16-18 May 1993, pp. 130-136.
4. E.R. Berlekamp, Block coding for the binary symmetric channel with noiseless, delayless feedback, in: H.B. Mann (Ed.), Error-Correcting Codes, Wiley, New York, 1968, pp. 61-88.
5. J. Czyzowicz, K.B. Lakshmanan, A. Pelc, Searching with a forbidden lie pattern in responses, Inform. Process. Lett. 37 (1991) 127-132.
6. J. Czyzowicz, D. Mundici, A. Pelc, Ulam's searching game with lies, J. Combin. Theory Ser. A 52 (1989) 62-76.
7. J. Czyzowicz, K.B. Lakshmanan, A. Pelc, Searching with local constraints on error patterns, European J. Combin. 15 (1994) 217-222.
8. D.Z. Du, F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific, Singapore, 1993.
9. W. Guzicki, Ulam's searching game with two lies, J. Combin. Theory Ser. A 54 (1990) 1-19.
10. R. Hill, Searching with lies, in: P. Rowlinson (Ed.), Surveys in Combinatorics Cambridge University Press, Cambridge, 1995, pp. 41-70.
11. R. Hill, J. Karim, E.R. Berlekamp, The solution of a problem of Ulam on searching with lies, to be presented at IEEE ISIT 1998, Cambridge, USA.
12. A. Malinowski, K-ary searching with a lie, Ars Combin. 37 (1994) 301-308.
13. D. Mundici, A. Trombetta, Optimal comparison strategies in Ulam's searching game with two errors, Theoret. Comput. Sci. 182 (1997) 217-232.
14. S. Muthukrishnan, On optimal strategies for searching in presence of errors, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania, 23-25 January 1994, pp. 680-689.
15. A. Negro, M. Sereno, Ulam's Searching game with three lies, Adv. Appl. Math. 13 (1992) 404-428.
16. A. Pelc, Detecting errors in searching games, J. Combin. Theory Ser. A 51 (1989) 43-54.
17. A. Pelc, Solution of Ulam's problem on searching with a lie, J. Combin. Theory Ser. A 44 (1987) 129-142.
18. A. Pelc, Lie patterns in search procedures, Theoret. Comput. Sci. 47 (1986) 61-69.
19. A. Pelc, Weakly adaptive comparison searching, Theoret. Comput. Sci. 66 (1989) 105-111.
20. A. Pelc, Detecting a counterfeit coin with unreliable weighing, Ars Combin. 27 (1989) 185-202.
21. A. Pelc, Searching with known error probability, Theoret. Comput. Sci. 63 (1989) 185-202.
22. A. Pelc, Prefix search with a lie, J. Combin. Theory Ser. A 48 (1988) 165-173.
23. B. Ravikumar, K.B. Lakshmanan, Coping with known patterns of lies in a search game, Theoret. Comput. Sci. 33 (1984) 85-94.
24. A. Rényi, Napló az információelméletrol, Gondolat, Budapest, 1976. (English translation: A diary on Information Theory, Wiley, New York, 1984).
25. A. Rényi, Napló az információelméletrol, Gondolat, Budapest, 1976. (English translation: A diary on Information Theory, Wiley, New York, 1984).
26. R.L. Rivest, A.R. Meyer, D.J. Kleitman, K. Winklmann, J. Spencer, Coping with errors in binary search procedures, J. Comput. System Sci. 20 (1980) 396-404.
27. M. Sereno, Binary search with errors and variable cost queries, Inform. Process. Lett. 68 (1998) 261-270.
28. J. Spencer, Ulam's searching game with a fixed number of lies, Theoret. Comput. Sci. 95 (1992) 307-321.
29. S.M. Ulam, Adventures of a Mathematician, Scribner's, New York, 1976.