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

Simple item page
dc.creatorPositselskaya, Lyubov N.
dc.date2007-08-15
dc.date2007-08-18
dc.date.accessioned2026-07-07T08:23:58Z
dc.date.available2026-07-07T08:23:58Z
dc.descriptionWe 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.
dc.descriptionLaTeX 2e, 22 pages; replaced to correct TeXnical mistakes and typos
dc.identifierhttps://arxiv.org/abs/0708.2023
dc.identifierhttp://arxiv.org/abs/0708.2023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136188
dc.subjectOptimization and Control
dc.subjectComputer Science and Game Theory
dc.subjectProbability
dc.titleNonantagonistic noisy duels of discrete type with an arbitrary number of actions
dc.typetext

Files

Collections

arXiv