Title of article :
How to play the one-lie Rényi–Ulam game
Author/Authors :
Robert B. Ellis، نويسنده , , Vadim Ponomarenko، نويسنده , , Catherine H. Yan، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
4
From page :
5805
To page :
5808
Abstract :
The one-lie Rényi–Ulam liar game is a two-player perfect information zero-sum game, lasting image rounds, on the set image. In each round Paul chooses a subset image and Carole either assigns one lie to each element of image or to each element of image. Paul wins the original (resp. pathological) game if after image 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 image and for both games.
Keywords :
Rényi–Ulam game , Searching with lies , Pathological liar game
Journal title :
Discrete Mathematics
Serial Year :
2008
Journal title :
Discrete Mathematics
Record number :
947200
Link To Document :
بازگشت