Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-24T04:50:59.784Z Has data issue: false hasContentIssue false
  • English
  • Français

The lying oracle game with a biased coin

Part of: General and miscellaneous specific topics Combinatorial probability Game theory

Published online by Cambridge University Press:  01 July 2016

Robb Koether ,
Marcus Pendergrass  and
John Osoinach
Robb Koether*
Affiliation:
Hampden-Sydney College
Marcus Pendergrass*
Affiliation:
Hampden-Sydney College
John Osoinach*
Affiliation:
Millsaps College
*
∗ Postal address: Box 166, Department of Mathematics and Computer Science, Hampden-Sydney College, Hampden-Sydney, VA 23943, USA.
∗∗ Postal address: Box 174, Department of Mathematics and Computer Science, Hampden-Sydney College, Hampden-Sydney, VA 23943, USA.
∗∗∗ Current address: University of Dallas, 1845 E. Northgate Drive, Irving, TX 75062-4736, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The lying oracle problem is a problem of finding the optimal strategies in a two-person game where an oracle predicts the outcomes of coin flips and a player bets on the outcomes. The oracle announces whether the coin will land heads or tails, but may at times lie. We analyze the variant of the game which uses a biased coin, where the probability p that the coin lands heads is common knowledge. We determine optimal strategies for both the oracle and player, and we give an explicit expression for the expected payoff to the player when the coin is flipped n times and the oracle may lie at most k times.

Keywords

Lying oracleprobabilistic gameoptimal strategyexpected payoffharmonic mean

MSC classification

Primary: 91A60: Probabilistic games; gambling
Secondary: 91A05: 2-person games 60C05: Combinatorial probability 00A08: Recreational mathematics
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 41 , Issue 4 , December 2009 , pp. 1023 - 1040
Copyright
Copyright © Applied Probability Trust 2009 

References

Gossner, O. and Vieille, N. (2002). How to play with a biased coin? Games Econom. Behavior 41, 206–226.CrossRefGoogle Scholar
Koether, R. (2007). The generalized paper-scissors-stone game. Preprint.Google Scholar
Koether, R. T. and Osoinach, J. K. (2005). Outwitting the lying oracle. Math. Mag. 78, 98–109.CrossRefGoogle Scholar
Pendergrass, M. (2009). A path guessing game with wagering. Preprint. Available at http://arxiv.org/abs/0907.2196.Google Scholar
Ravikumar, B. (2005). Some connections between the lying oracle problem and Ulam's search problem. In Proc. Australasian Workshop Combinatorial Algorithms (Ballarat, September 2005), eds Ryan, J. et al., University of Ballarat, pp. 269–277.Google Scholar
Rivest, R. L., Mayer, A. R., Kleitman, D. J. and Winklemann, K. (1980). Coping with errors in binary search procedures. J. Comput. System Sci. 20, 396–404.CrossRefGoogle Scholar