Searching with lies under error cost constraints
From MaRDI portal
Publication:947085
Recommendations
Cites work
- scientific article; zbMATH DE number 1577986 (Why is no real title available?)
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 1405795 (Why is no real title available?)
- scientific article; zbMATH DE number 3205803 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- Algorithms and Computation
- Computing and Combinatorics
- Least adaptive optimal search with unreliable tests
- Nonbinary error-correcting codes with one-time error-free feedback
- Q-Ary Ulam-Renyi Game with Constrained Lies
- Searching games with errors -- fifty years of coping with liars
- The liar game over an arbitrary channel
Cited in
(10)- Two-batch liar games on a general bounded channel
- Searching games with errors -- fifty years of coping with liars
- Computing and Combinatorics
- Optimal Search Among False Contacts
- Searching with a forbidden lie pattern in responses
- scientific article; zbMATH DE number 512984 (Why is no real title available?)
- Interactive Communication, Diagnosis and Error Control in Networks
- How to read a randomly mixed up message
- Two cooperative versions of the guessing secrets problem
- Minimum number of queries for an adaptive liar search game with small sets
This page was built for publication: Searching with lies under error cost constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947085)