The liar game over an arbitrary channel
From MaRDI portal
Publication:2368587
Recommendations
Cited in
(16)- Two-batch liar games on a general bounded channel
- Minimum number of queries for an adaptive liar search game with small sets
- Truth tellers and liars with fewer questions
- Lying in a finitely repeated game
- Searching with lies under error transition cost constraints
- Q-ary Ulam-Rényi game with constrained lies
- The Interval Liar Game
- The lying oracle game with a biased coin
- scientific article; zbMATH DE number 18883 (Why is no real title available?)
- scientific article; zbMATH DE number 742943 (Why is no real title available?)
- Perfect strategies for the Ulam-Rényi game with multi-interval questions
- The Two-Batch Liar Game over an Arbitrary Channel
- Linearly bounded liars, adaptive covering codes, and deterministic random walks
- Twenty questions with random error
- Searching with lies under error cost constraints
- How to play the majority game with a liar
This page was built for publication: The liar game over an arbitrary channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368587)