Searching with lies under error cost constraints

DOI10.1016/j.dam.2007.04.033zbMath1151.68046OpenAlexW2039897275MaRDI QIDQ947085

Ferdinando Cicalese, 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

zbMATH Keywords

coding with feedbacksearching with lies

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Other game-theoretic models (91A40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information theory (general) (94A15)

Related Items (5)

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 ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Two-batch liar games on a general bounded channel

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

This page was built for publication: Searching with lies under error cost constraints