The liar game over an arbitrary channel
From MaRDI portal
Publication:2368587
DOI10.1007/s00493-005-0033-3zbMath1097.91024OpenAlexW2044908445MaRDI QIDQ2368587
Publication date: 5 October 2006
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-005-0033-3
2-person games (91A05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial games (91A46)
Related Items
Perfect strategies for the Ulam-Rényi game with multi-interval questions, Searching with lies under error cost constraints, Minimum number of queries for an adaptive liar search game with small sets, Searching with lies under error transition cost constraints, Q-ary Ulam-Rényi game with constrained lies