Claremont Center for the Mathematical Sciences

We imagine a game in which Carole thinks of a number between 1 and n, and Paul tries to determine this number by asking Carole questions. The twist comes in when we allow Carole to lie up to k times according to a "channel of allowable lies". We look at a strategy of packings and coverings through which Paul can win the game for a given n. This is joint work with Robert Ellis.