Skip to main content Accessibility help
×
Home
Hostname: page-component-55b6f6c457-pc5cw Total loading time: 0.283 Render date: 2021-09-24T12:33:58.742Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Dynamic Programming Principle for tug-of-war games with noise

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 II play an ε-step tug-of-war game with probability α, and with probability β (α + β = 1), a random point in the ball of radius ε centered at x is chosen. Once the game position reaches the boundary, Player II pays Player I the amount given by a fixed payoff function F. We give a detailed proof of the fact that the value functions of this game satisfy the Dynamic Programming Principle

for x  Ω with u(y) = F(y) when y ∉ Ω. This principle implies the existence of quasioptimal Markovian strategies.

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.)

References

Le Gruyer, E., On absolutely minimizing Lipschitz extensions and PDE Δ (u) = 0. NoDEA 14 (2007) 2955. Google Scholar
Le Gruyer, E. and Archer, J.C., Harmonious extensions. SIAM J. Math. Anal. 29 (1998) 279292. Google Scholar
Maitra, A.P. and Sudderth, W.D., Borel stochastic games with limsup payoff. Ann. Probab. 21 (1993) 861885. Google Scholar
A.P. Maitra and W.D. Sudderth, Discrete gambling and stochastic games, Applications of Mathematics 32. Springer-Verlag (1996).
Manfredi, J.J., Parviainen, M. and Rossi, J.D., An asymptotic mean value property characterization of p-harmonic functions. Proc. Am. Math. Soc. 138 (2010) 881889. Google Scholar
J.J. Manfredi, M. Parviainen and J.D. Rossi, On the definition and properties of p -harmonious functions. Preprint (2009).
Oberman, A., A convergent difference scheme for the infinity Laplacian : construction of absolutely minimizing Lipschitz extensions. Math. Comp. 74 (2005) 12171230. Google Scholar
Peres, Y. and Sheffield, S., Tug-of-war with noise : a game theoretic view of the p-Laplacian. Duke Math. J. 145 (2008) 91120. Google Scholar
Peres, Y., Schramm, O., Sheffield, S. and Wilson, D., Tug-of-war and the infinity Laplacian. J. Am. Math. Soc. 22 (2009) 167210. Google Scholar
S.R.S. Varadhan, Probability theory, Courant Lecture Notes in Mathematics 7. Courant Institute of Mathematical Sciences, New York University/AMS (2001).

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Dynamic Programming Principle for tug-of-war games with noise
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Dynamic Programming Principle for tug-of-war games with noise
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Dynamic Programming Principle for tug-of-war games with noise
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *