On the Simple N-Person Games of Timing with Random Termination
The n-person marksmanship contests are solved in the case when the contest is to be terminated at a random time T with cdf H(t). The model is the simplest case where each player (i.e., contestant) has one bullet and all players have accuracy t. The game is nonzero-sum and is analyzed under the assumption \(\{\) 1-H(t)\(\}^ t \)is unimodal with respect to t. Similarly as in duels, the silent version and the noisy one are considered. For related works see \textit{M. Sakaguchi}, Math. Jap. 22, 585- 596 (1978; Zbl 0393.90107); \textit{T. Kuriso}, J. Oper. Res. Soc. Jap. 23, 326-340 (1980; Zbl 0448.90077) and \textit{Y. Teraoka}, J. Optimization Theory Appl. 40, 379-396 (1983; Zbl 0494.90091).
- Silent-noisy marksmanship contest with random termination
- Endogenous timing in two-player games: A counterexample
- Stochastic marksmanship contest games with random termination -- survey and applications
- scientific article; zbMATH DE number 4020877 (Why is no real title available?)
- scientific article; zbMATH DE number 4033536 (Why is no real title available?)
- 1½-Player Stochastic StopWatch Games
This page was built for publication: On the Simple N-Person Games of Timing with Random Termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701218)