Tactical problems involving uncertain actions

DOI10.1007/BF00939249MaRDI QIDQ1061020zbMATH OpenOpenAlexFDO

Authors Andrzej Cegielski

Publication date 1986

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00939249

zbMATH Keywords

games of timingm-silent versus n-silent dueloptimal strategies

Mathematics Subject Classification ID

2-person games (91A05)

Review text

The purpose of this paper is to solve an 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(0)=Q(0)=0\), P(1)\(\in (0,1)\), Q(1)\(\in (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.

Recommendations

• scientific article; zbMATH DE number 3862971
• scientific article; zbMATH DE number 1490106
• scientific article; zbMATH DE number 32312
• scientific article; zbMATH DE number 33145
• Discrete silent duels with complete counteraction

Cites work

• scientific article; zbMATH DE number 3128742 (Why is no real title available?)
• scientific article; zbMATH DE number 4020877 (Why is no real title available?)
• scientific article; zbMATH DE number 3225772 (Why is no real title available?)
• Noisy duel with uncertain existence of the shot

Cited in

(4)

• Solution of a ilent duel with arbitrary motion and arbitrary accuracy functions
• Solution of a silent duel under general assumptions
• scientific article; zbMATH DE number 1490106 (Why is no real title available?)
• A silentnversus 1 bullet duel with retreat after the shots

This page was built for publication: Tactical problems involving uncertain actions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061020)