2009/10/04 by Lyubov N. Positselskaya, Positselskaya, Lyubov N.
Computer Science · Engineering · Mathematics · #Artificial Intelligence in Games #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Guidance and Control Systems #Military Defense Systems Analysis #Optimization and Control (math.OC) #Probability (math.PR) #cs.GT #math.OC #math.PR
paper · pdf · doi:10.48550/arxiv.0910.0548
Equally detailed English and Russian versions, each 23 pages long. LaTeX 2e, with Babel for the Russian version
arxiv created 2009/10/04 · openalex publication_date 2009/10/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We discuss a duel-type game in which Player I uses his resource continuously and Player II distributes it by discrete portions. Each player knows how much resources he and his opponent have at every moment of time. The solution of the game is given in an explicit form. Keywords: noisy duel, payoff, strategy, the value of a game, consumption of resource.