Please use this identifier to cite or link to this item:
Year of Publication: 
Series/Report no.: 
Center for Mathematical Economics Working Papers No. 630
Bielefeld University, Center for Mathematical Economics (IMW), Bielefeld
We consider a convexity constrained Hamilton-Jacobi-Bellman-type obstacle problem for the value function of a zero-sum differential game with asymmetric information. We propose a convexity-preserving probabilistic numerical scheme for the approximation of the value function which is discrete w.r.t. the time and convexity variables, and show that the scheme converges to the unique viscosity solution of the considered problem. Furthermore, we generalize the semi-discrete scheme to obtain an implementable fully discrete numerical approximation of the value function and present numerical experiments to demonstrate the properties of the proposed numerical scheme.
Persistent Identifier of the first edition: 
Document Type: 
Working Paper

Files in This Item:
784.68 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.