Nonantagonistic noisy duels of discrete type with an arbitrary number of actions

2007/08/15 by Lyubov N. Positselskaya, Positselskaya, Lyubov N.
Computer Science · Mathematics · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Probability (math.PR) #cs.GT #math.OC #math.PR

paper · pdf · doi:10.48550/arxiv.0708.2023

LaTeX 2e, 22 pages; replaced to correct TeXnical mistakes and typos

arxiv created 2007/08/18 · arxiv updated 2009/12/01

Abstract

We study a nonzero-sum game of two players which is a generalization of the antagonistic noisy duel of discrete type. The game is considered from the point of view of various criterions of optimality. We prove existence of epsilon-equilibrium situations and show that the epsilon-equilibrium strategies that we have found are epsilon-maxmin. Conditions under which the equilibrium plays are Pareto-optimal are given. Keywords: noisy duel, payoff function, strategy, equilibrium situation, Pareto optimality, the value of a game.

Related

• Noisy fighter-bomber duel
• Two-player nonZero–sum stopping games in discrete time
• On the Nash Equilibria of a Simple Discounted Duel
• Mixed Nash Equilibria in the Adversarial Examples Game
• 2 × 2 Zero-Sum Games with Commitments and Noisy Observations