Abstract
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite set using as few question as possible when up to a finite number e of the answers may be lies. In the variant, we consider in this paper, questions with q many possible answers are allowed, q fixed and known beforehand, and lies are constrained as follows: Let \({\mathcal Q} = \{0,1,\dots, q-1\}\) be the set of possible answers to a q-ary question. For each \(k \in {\mathcal Q}\) when the sincere answer to the question is k, the responder can choose a mendacious answer only from a set \(L(k) \subseteq {\mathcal Q} \setminus \{k\}.\) For each \(k \in {\mathcal Q} ,\) the set L(k) is fixed before the game starts and known to the questioner. The classical q-ary Ulam-Rényi game, in which the responder is completely free in choosing the lies, in our setting corresponds to the particular case \(L(k) = {\mathcal Q} \setminus \{k\},\) for each \(k \in {\mathcal Q}.\) The problem we consider here, is suggested by the counterpart of the Ulam-Rényi game in the theory of error-correcting codes, where (the counterparts of) lies are due to the noise in the channel carrying the answers. We shall use our assumptions on noise and its effects (as represented by the constraints L(k) over the possible error patterns) with the aim of producing the most efficient search strategies. We solve the problem by assuming some symmetry on the sets L(k): specifically, we assume that there exists a constant d ≤q–1 such that |L(k)| = d for each k, and the number of indices j such that k ∈L(j) is equal to d. We provide a lower bound on the number of questions needed to solve the problem and prove that in infinitely many cases this bound is attained by (optimal) search strategies. Moreover we prove that, in the remaining cases, at most one question more than the lower bound is always sufficient to successfully find the unknown number. Our results are constructive and search strategies are actually provided. All our strategies also enjoy the property that, among all the possible adaptive strategies, they use the minimum amount of adaptiveness during the search process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aigner, M.: Searching with lies. J. Comb. Theory, Ser. A 74, 43–56 (1995)
Cicalese, F., Deppe, C.: Quasi-perfect minimally adaptive q-ary search with unreliable test. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 527–536. Springer, Heidelberg (2003)
Cicalese, F., Vaccaro, U.: Optimal strategies against a liar. Theoretical Computer Science 230, 167–193 (2000)
Cicalese, F., Mundici, D., Vaccaro, U.: Least adaptive optimal search with unreliable tests. Theoretical Computer Science 270(1-2), 877–893 (2001)
Dumitriu, I., Spencer, J.: The liar game over an arbitrary channel (preprint, 2003)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Malinowski, A.: K-ary searching with a lie. Ars Combinatoria 37, 301–308 (1994)
Muthukrishnan, S.: On optimal strategies for searching in presence of errors. In: Proc. of the 5th ACM-SIAM SODA, pp. 680–689 (1994)
Pelc, A.: Searching games with errors – fifty years of coping with liars. Theoret. Comput. Sci. 270(1-2), 71–109 (2002)
Rényi, A.: Napló az Információelméletről, Gondolat, Budapest (1976); English translation: A Diary on Information Theory. J.Wiley and Sons, New York (1984)
Rényi, A.: On a problem of information theory. MTA Mat. Kut. Int. Kozl. 6B, 505–516 (1961)
Spencer, J.: Ulam’s searching game with a fixed number of lies. Theoretical Comp. Sci. 95, 307–321 (1992)
Ulam, S.M.: Adventures of a Mathematician. Scribner’s, New York (1976)
Zinoviev, V.A., Katsman, G.L.: Universal code families. Problems of Information Transmission 29(2), 95–100 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cicalese, F., Deppe, C. (2006). Q-Ary Ulam-Renyi Game with Constrained Lies. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_42
Download citation
DOI: https://doi.org/10.1007/11889342_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)