Robust Pairwise n-Person Stochastic Duel Game

TL;DR

This paper introduces a mathematically rigorous model for multi-person antagonistic duel games with multiple battlefields, providing explicit formulas for optimal shooting times, applicable to real-world target shooting scenarios.

Contribution

It develops the first explicit analytical solution for a multi-person duel game with multiple battlefields using the first exceed theory, extending traditional two-person duel models.

Findings

Explicit formulas for duel timing are derived.

The model accommodates multiple battlefields.

Applicable to real-world target shooting scenarios.

Abstract

This paper is dealing with another multiple person game model under the antagonistic duel type setup. The most flexible multiple person duel game is analytically solved and the explicit formulas are solved to determine the time dependent duel game model by using the first exceed theory. Unlike conventional two-person duel game, multiple battle fields are introduced in the paper and each battle field becomes shooting ground of pairwise players. This model is targeted for real-world situations especially for selected target shooting scenarios. An analogue of the theory in the paper is designed for solving the best shooting time within multiple battle fields. This new proposed model is fully mathematically explained to be adapted in various domains including the strategies and operations.