Abstract
The purpose of this paper is to solve anm-silent versusn-silent duel with arbitrary accuracy functionsP andQ which are continuously differentiable in [0, 1] with positive derivatives in (0, 1) and such thatP(0)=Q(0)=0,P(1)∈(0, 1),Q(1)∈(0, 1). The game can be interpreted as a game in which the players know only that the numbers of their actions have binomial distribution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Restrepo, R.,Tactical Problems Involving Several Actions, Contributions to the Theory of Games, Annals of Mathematical Studies, Vol. 3, pp. 313–335, 1957.
Teraoka, Y.,Silent Duel with Uncertain Shot, Reports of the Himeji Institute of Technology, Vol. 28A, pp. 1–8, 1975.
Karlin, S.,Mathematical Methods and Theory in Games, Programming, and Economics, Vol. 2, Addison-Wesley, Reading, Massachusetts, 1959.
Cegielski, A.,Game of Timing with Uncertain Number of Shots, Mathematica Japanica, Vol. 31, No. 4, 1986.
Cegielski, A.,Mixed Game of Timing of Type 1×1with Uncertain Actions, Roczniki PTM, Seria 3, Matematyka Stosowana, Vol. 16, pp. 99–106, 1980 (in Polish).
Teraoka, Y.,Noisy Dual with Uncertain Existence of the Shot, International Journal of Game Theory, Vol. 5, pp. 239–250, 1976.
Author information
Authors and Affiliations
Additional information
Communicated by G. Leitmann
Part of this paper was written during the author's stay at the Institute of Statistics and Mathematical Economics, University of Karlsruhe, FRG. The author wishes to thank Prof. S. Trybuła, Technical University of Wrocław, Poland, for helpful discussion in preparing the paper and Prof. D. Pallaschke, University of Karlsruhe, FRG, for help in preparing the numerical example.
Rights and permissions
About this article
Cite this article
Cegielski, A. Tactical problems involving uncertain actions. J Optim Theory Appl 49, 81–105 (1986). https://doi.org/10.1007/BF00939249
Issue Date:
DOI: https://doi.org/10.1007/BF00939249