Hostname: page-component-66d9dcfd78-9877g Total loading time: 0 Render date: 2026-08-09T13:30:42.240Z Has data issue: false hasContentIssue false

Dynamic Programming Principle for tug-of-war games withnoise

Published online by Cambridge University Press:  02 December 2010

Juan J. Manfredi
Affiliation:
Department of Mathematics, University of Pittsburgh, Pittsburgh, PA 15260, USA. manfredi@pitt.edu
Mikko Parviainen
Affiliation:
Institute of Mathematics, Helsinki University of Technology, P.O. Box 1100, 02015 TKK, Finland; Mikko.Parviainen@tkk.fi
Julio D. Rossi
Affiliation:
Departamento de Matemática, FCEyN UBA (1428), Buenos Aires, Argentina; jrossi@dm.uba.ar
Get access

Abstract

We consider a two-player zero-sum-game in a bounded open domain Ωdescribed as follows: at a point x  Ω, Players I and IIplay an ε-step tug-of-war game with probability α, andwith probability β (α + β = 1), arandom point in the ball of radius ε centered at x ischosen. Once the game position reaches the boundary, Player II pays Player I the amountgiven by a fixed payoff function F. We give a detailed proof of the factthat the value functions of this game satisfy the Dynamic Programming Principle

for x  Ω withu(y) = F(y) wheny ∉ Ω. This principle implies the existence ofquasioptimal Markovian strategies.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable