An approximate dynamic programming approach to solving dynamic oligopoly models
In this article, we introduce a new method to approximate Markov perfect equilibrium in large-scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of dimensionality. The method is based on an algorithm that iterates an approximate bes...
Main Authors: | Farias, Vivek F., Saure, Denis, Weintraub, Gabriel Y. |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
Wiley Blackwell
2012
|
Online Access: | http://hdl.handle.net/1721.1/74676 https://orcid.org/0000-0002-5856-9246 |
Similar Items
-
Approximate Dynamic Programming via a Smoothed Linear Program
by: Desai, Vijay V., et al.
Published: (2012) -
Non-Parametric Approximate Dynamic Programming via the Kernel Method
by: Bhat, Nikhil, et al.
Published: (2014) -
Dynamic Oligopoly with Incomplete Information
by: Bonatti, Alessandro, et al.
Published: (2018) -
A theory of dynamic oligopoly.
by: Maskin, Eric, et al.
Published: (2011) -
Strategic Trade and Industrial Policy towards Dynamic Oligopolies.
by: Neary, J, et al.
Published: (2000)