Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Sood, Arnav"'
We propose a new method for solving high-dimensional dynamic programming problems and recursive competitive equilibria with a large (but finite) number of heterogeneous agents using deep learning. The „curse of dimensionality“ is avoided due to f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1687::06f60fab8914e4ad01db1c14a98eba6c
https://hdl.handle.net/10419/236703
https://hdl.handle.net/10419/236703
