We study a duel game in which each player has incomplete knowledge of the game parameters. We present a simple, heuristically motivated and easily implemented algorithm by which, in the course of repeated plays, each player estimates the missing parameters and consequently learns his optimal...

We formulate and study a two-player duel game as a terminal payoffs stochastic game. Players 𝑃1,𝑃2 are standing in place and, in every turn, each may shoot at the other (in other words, abstention is allowed). If 𝑃𝑛 shoots 𝑃𝑚 (𝑚≠𝑛), either they hit and kill them (with...