No label defined (Q3329247)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3860909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3860909 |
Statements
1982
0 references
game of timing
0 references
discrete duel
0 references
pure strategies
0 references
stepwise accuracy functions
0 references
noisy duel
0 references
0.8888556361198425
0 references
The paper is composed of three chapters. The first one presents the solution of a discrete duel. Let \(t_ i\in [0,1]\), \(i=1,\dots, N\) be a fixed, finite sequence of moments of time and \(P_ j (j=1,2)\) two non- decreasing functions defined on \([0,1]\). Two opponents \(A\) and \(B\) try to hit each other using an arbitrary portion of ammunition \(a\) and \(b\), respectively, at discrete times \(t_ i\). The value \(P_ j(t_ i)\) is the probability of hitting the opponent with the unit portion of ammunition. If the \(j\)-th player survives then he wins \(A_ j\geq 0\) and if both players are hit then the first player gets \(A_ 1-A_ 2\). Otherwise, the payoff is zero. If the players are not informed about the portions of ammunition already used by the opponent then the duel is silent. If the current quantities of ammunition are known then the duel is noisy. It is proved that the silent discrete duel has a solution among pure strategies of the form \(\{\xi_ i\), \(i=1,\dots, N\}\) and \(\{\eta_ i\), \(i=1,\dots, N\}\) with \(\sum \xi_ i=a\), \(\sum \eta_ i=b\). Since the form of the payoff function is a polynomial in some auxiliary variables geometric programming can be applied to determine the value of the game and its optimal strategies. Next, a necessary and sufficient condition for the solution of a corresponding extremal problem is given. Section 3 of the first chapter treats the silent duel of machine-gunners with stepwise accuracy functions \(P_ j\). It is proved that the solution of that game is obtained via the solution of a discrete duel where the moments of time \(t_ i\) are ordered discontinuity points of \(P_ j.\) Chapter II presents the solution of the noisy duel of machine-gunners with continuous accuracy functions \(P_ j\). The payoff function is found as the limit of payoff functions for a sequence of discrete duels. Next, the noisy duel with accuracy functions satisfying \(\ln(1-P_ 2(t))=c \ln(1-P_ 1(t))\) is solved. The last chapter is devoted to the noisy duel of a machine-gunner vs. a sniper. Introducing some auxiliary notions a characterization of the solution for that game is given. Finally, the analytical solution with numerical examples is presented.
0 references