The following pages link to Optimal strategies against a liar (Q1978508):
Displaying 25 items.
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie (Q628343) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Coping with known patterns of lies in a search game (Q797505) (← links)
- Searching with lies under error cost constraints (Q947085) (← links)
- Detecting errors in searching games (Q1119495) (← links)
- Ulam's searching game with a fixed number of lies (Q1184984) (← links)
- The halflie problem. (Q1399909) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
- Strategies for the Renyi--Ulam game with fixed number of lies (Q1884914) (← links)
- Ulam's liar problem (Q1897482) (← links)
- Searching with lies (Q1913996) (← links)
- Truth tellers and liars with fewer questions (Q2342617) (← links)
- \(Q\)-ary search with one Lie and bi-interval queries (Q2379948) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Searching for knights and spies: a majority/minority game (Q2629287) (← links)
- Minimum and Maximum against k Lies (Q3569886) (← links)
- Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
- Search with small sets in presence of a liar (Q5957834) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies (Q5962511) (← links)
