Searching with lies under error cost constraints
From MaRDI portal
Publication:947085
DOI10.1016/j.dam.2007.04.033zbMath1151.68046MaRDI QIDQ947085
Ferdinando Cicalese, Rudolf Ahlswede, Christian Deppe
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
90B40: Search theory
91A05: 2-person games
91A40: Other game-theoretic models
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
94A15: Information theory (general)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The liar game over an arbitrary channel
- Nonbinary error-correcting codes with one-time error-free feedback
- Computing and Combinatorics
- Algorithms and Computation
- Q-Ary Ulam-Renyi Game with Constrained Lies
- Searching games with errors -- fifty years of coping with liars
- Least adaptive optimal search with unreliable tests