A simple solution to Ulam's liar game with one lie (Q952012): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5568914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fault-tolerant search algorithms. Reliable computation with unreliable information / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4841306 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of Ulam's problem on searching with a lie / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching games with errors -- fifty years of coping with liars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coping with errors in binary search procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Guess a Number-with Lying / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ulam's searching game with a fixed number of lies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4121861 / rank | |||
Normal rank |
Latest revision as of 19:45, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple solution to Ulam's liar game with one lie |
scientific article |
Statements
A simple solution to Ulam's liar game with one lie (English)
0 references
5 November 2008
0 references
In the general form of Ulam's liar game between a questioner and a responder, the responder thinks of an integer \(x\) in \(\{1, \ldots,n\}\) and the questioner must determine \(x\) by asking questions the answers to which are ``yes'' or ``no''. The responder is allowed to lie on at most \(k\) of the responses. Let \(q_k(n)\) denote the maximum number of questions needed by the questioner, in an optimal strategy, to determine \(x\). Based on earlier work by \textit{R. L. Rivest} et al. [J. Comput. Syst. Sci. 20, 396--404 (1980; Zbl 0443.68043)], \textit{A. Pelc} [J. Comb. Theory, Ser. A 44, 129--140 (1987; Zbl 0621.68056)] determined \(q_1(n)\) for all \(n\). The authors of the present paper give a relatively simple strategy and analysis for the game with \(k=1\) which implies the result of Pelc for many values of \(n\).
0 references
Ulam's liar game
0 references