Silent Duel with Accuracies Less than 1

  • A. Cegielski
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 226)

Abstract

This paper contains a brief presentation of the methods of solution a m-silent versus n-silent duel with arbitrary accuracy functions P and Q which are continuously differentiable in [0,1] with positive derivatives in (0,1) and such that P(O)=Q(O)=O, P (1) ∈ (0,1), Q (1) ∈ (0,1).

Keywords

Games of timing silent duels optimal strategies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cegielski, A., Tactical Problems Involving Uncertain Actions, to appear.Google Scholar
  2. [2]
    Karlin, S., Mathematical Methods and Theory in Games, Programming and Economics, Pergamon Press, London, 1959.Google Scholar
  3. [3]
    Restrepo, R., Tactical Problems Involving Several Actions, Contributions to the Theory of Games, Vol.III, Ann. Math. Studies, Vol. 39, pp.313–335, 1957.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • A. Cegielski
    • 1
  1. 1.Department of MathematicsHigher Engineering CollegeZielona GóraPoland

Personalised recommendations