Searching with lies under error cost constraints
DOI10.1016/J.DAM.2007.04.033zbMATH Open1151.68046OpenAlexW2039897275MaRDI QIDQ947085FDOQ947085
Authors: Ferdinando Cicalese, Christian Deppe, Rudolf Ahlswede 
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.033
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Search theory (90B40) Information theory (general) (94A15) 2-person games (91A05) Other game-theoretic models (91A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Searching games with errors -- fifty years of coping with liars
- The liar game over an arbitrary channel
- Title not available (Why is that?)
- Algorithms and Computation
- Title not available (Why is that?)
- Least adaptive optimal search with unreliable tests
- Computing and Combinatorics
- Q-Ary Ulam-Renyi Game with Constrained Lies
- Nonbinary error-correcting codes with one-time error-free feedback
- Title not available (Why is that?)
Cited In (10)
- Searching games with errors -- fifty years of coping with liars
- Optimal Search Among False Contacts
- How to read a randomly mixed up message
- Title not available (Why is that?)
- Two cooperative versions of the guessing secrets problem
- Computing and Combinatorics
- Searching with a forbidden lie pattern in responses
- Minimum number of queries for an adaptive liar search game with small sets
- Two-batch liar games on a general bounded channel
- Interactive Communication, Diagnosis and Error Control in Networks
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)
