Results 11 to 20 of about 270 (146)
n-Player Stochastic Duel Game Model with Applied Deep Learning and Its Modern Implications [PDF]
This paper provides a conceptual foundation for stochastic duels and contains a further study of the game models based on the theory of stochastic duels.
Manik Gupta +6 more
doaj +6 more sources
A Versatile Stochastic Duel Game [PDF]
This paper deals with a standard stochastic game model with a continuum of states under the duel-type setup. It newly proposes a hybrid model of game theory and the fluctuation process, which could be applied for various practical decision making ...
Song-Kyoo (Amang) Kim
doaj +6 more sources
Antagonistic One-To-N Stochastic Duel Game [PDF]
This paper is dealing with a multiple person game model under the antagonistic duel type setup. The unique multiple person duel game with the one-shooting-to-kill-all condition is analytically solved and the explicit formulas are obtained to determine ...
Song-Kyoo (Amang) Kim
doaj +6 more sources
Two-Person Stochastic Duel with Energy Fuel Constraint Ammo [PDF]
This paper deals with a novel variation of the versatile stochastic duel game that incorporates an energy fuel constraint into a two-player duel game. The energy fuel not only measures the vitality of players but also determines the power of the shooting
Song-Kyoo (Amang) Kim
doaj +6 more sources
Robust Pairwise n-Person Stochastic Duel Game [PDF]
This paper introduces an extended version of a stochastic game under the antagonistic duel-type setup. The most flexible multiple person duel game is analytically solved.
Song-Kyoo (Amang) Kim
doaj +5 more sources
The Many-on-One Stochastic Duel Model with Information-Sharing
In this paper we extend the one-on-one stochastic duel model with searching to the many-on-one case based on information-sharing. We have derived the probability density function of the time to kill the target in many-on-one model. It is illustrated by an example in which the firing time and the searching time are of different exponential distributions.
Jianjun Li, Liwei Liu
exaly +4 more sources
Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models [PDF]
We consider the regret minimization task in a dueling bandits problem with context information. In every round of the sequential decision problem, the learner makes a context-dependent selection of two choice alternatives (arms) to be compared with each other and receives feedback in the form of noisy preference information. We assume that the feedback
Viktor Bengs +2 more
openalex +5 more sources
On the Nash Equilibria of a Duel with Terminal Payoffs
We formulate and study a two-player duel game as a terminal payoffs stochastic game. Players P1,P2 are standing in place and, in every turn, each may shoot at the other (in other words, abstention is allowed).
Athanasios Kehagias
doaj +3 more sources
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits [PDF]
Dueling bandits is a prominent framework for decision-making involving preferential feedback, a valuable feature that fits various applications involving human interaction, such as ranking, information retrieval, and recommendation systems. While substantial efforts have been made to minimize the cumulative regret in dueling bandits, a notable gap in ...
Qiwei Di +5 more
openalex +4 more sources
Biased Dueling Bandits with Stochastic Delayed Feedback [PDF]
The dueling bandit problem, an essential variation of the traditional multi-armed bandit problem, has become significantly prominent recently due to its broad applications in online advertising, recommendation systems, information retrieval, and more.
Bongsoo Yi, Yue Kang, Yao Li
openalex +4 more sources

