Abstract
The one-lie Rényi–Ulam liar game is a two-player perfect information zero-sum game, lasting q rounds, on the set [ n ] ≔ { 1 , … , n } . In each round Paul chooses a subset A ⊆ [ n ] and Carole either assigns one lie to each element of A or to each element of [ n ] ∖ A . Paul wins the original (resp. pathological) game if after q rounds there is at most one (resp. at least one) element with one or fewer lies. We exhibit a simple, unified, optimal strategy for Paul to follow in both games, and use this to determine which player can win for all q , n and for both games.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
