Strategies for the Renyi–Ulam Game with fixed number of lies
نویسندگان
چکیده
منابع مشابه
Ulam's Searching Game with a Fixed Number of Lies
Spencer, J., Ulam’s searching game with a fixed number of lies, Theoretical Computer Science 95 (1992) 3077321. Paul tries to find an unknown x from 1 to n by asking 4 Yes-No questions. In response Carole may lie up to k times. For k fixed and n, 4 sufficiently large, necessary and sufficient conditions are given for Paul to win.
متن کاملThe Rényi-Ulam pathological liar game with a fixed number of lies
The q-round Rényi-Ulam pathological liar game with k lies on the set [n] := {1, . . . , n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [n]\A. Paul wins if after q rounds there is at least one element with k or fewer lies. The game is dual to the original Rényi-Ulam liar ga...
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.10.036