Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin

Abstract

This paper deals with the application of approximation theory techniques to study a classical problem in probability: estimating the parameter of a biased coin. For this purpose, a minimax estimation problem is considered, and the characterization of the optimal estimator is shown together with the weak asymptotics of such optimal choices as the number of coin tosses approaches infinity. In addition, a number of numerical examples and graphs are provided. At the same time, the problem is also discussed from the game theory viewpoint, as a non-cooperative, two-player game, and the existence of a Nash-equilibrium is established. The particular case of n=2 tosses is completely solved.