Solving Dynamic Discrete Choice Models Using Smoothing and Sieve Methods

04/10/2019
by   Dennis Kristensen, et al.
0

We propose to combine smoothing, simulations and sieve approximations to solve for either the integrated or expected value function in a general class of dynamic discrete choice (DDC) models. We use importance sampling to approximate the Bellman operators defining the two functions. The random Bellman operators, and therefore also the corresponding solutions, are generally non-smooth which is undesirable. To circumvent this issue, we introduce a smoothed version of the random Bellman operator and solve for the corresponding smoothed value function using sieve methods. We show that one can avoid using sieves by generalizing and adapting the `self-approximating' method of Rust (1997) to our setting. We provide an asymptotic theory for the approximate solutions and show that they converge with root-N-rate, where N is number of Monte Carlo draws, towards Gaussian processes. We examine their performance in practice through a set of numerical experiments and find that both methods perform well with the sieve method being particularly attractive in terms of computational speed and accuracy.

READ FULL TEXT
research
06/08/2022

ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret

Recent techniques for approximating Nash equilibria in very large games ...
research
02/27/2013

Efficient Estimation of the Value of Information in Monte Carlo Models

The expected value of information (EVI) is the most powerful measure of ...
research
11/02/2021

Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing

When approximating the expectation of a functional of a stochastic proce...
research
07/15/2022

Set-based value operators for non-stationary Markovian environments

This paper analyzes finite state Markov Decision Processes (MDPs) with u...
research
12/08/2017

A Class of Logistic Functions for Approximating State-Inclusive Koopman Operators

An outstanding challenge in nonlinear systems theory is identification o...
research
12/03/2022

Smoothing Policy Iteration for Zero-sum Markov Games

Zero-sum Markov Games (MGs) has been an efficient framework for multi-ag...
research
06/05/2017

Approximate Program Smoothing Using Mean-Variance Statistics, with Application to Procedural Shader Bandlimiting

This paper introduces a general method to approximate the convolution of...

Please sign up or login with your details

Forgot password? Click here to reset