Papers › Robust Pairwise n-Person Stochastic Duel Game
Robust Pairwise n-Person Stochastic Duel Game
Song-Kyoo Kim
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections