We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.
MiS Preprint
85/2013
A Game-Tree approach to discrete infinity Laplacian with running costs
Qing Liu and Armin Schikorra
Abstract
We give a self-contained and elementary proof for boundedness, existence, and uniqueness of solutions to dynamic programming principles (DPP) for biased tug-of-war games with running costs. The domain we work in is very general, and as a special case contains metric spaces. Technically, we introduce game-trees and show that a discretized flow converges uniformly, from which we obtain not only the existence, but also the uniqueness. Our arguments are entirely deterministic, and also do not rely on (semi-)continuity in any way; in particular, we do not need to mollify the DPP at the boundary for well-posedness.
