An approximate dynamic programming approach to solving dynamic oligopoly models

By Vivek F. Farias, Denis Sauré, Gabriel Y. Weintraub. 2012

621 citations recorded by the source corpus.

In this article, we introduce a new method to approximate Markov perfect equilibrium in largescale 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 best response operator using an approximate dynamic programming approach. The method, based on mathematical programming, approximates the value function with a linear combination of basis functions. We provide results that lend theoretical support to our approach. We introduce a rich yet tractable set of basis functions, and test our method on important classes of models. Our results suggest that the approach we propose significantly expands the set of dynamic oligopoly models that can be analyzed computationally.

Subfields: Economics and Econometrics, Marketing

View Paper: https://www.semanticscholar.org/paper/9754cedaaec628919630c8b3a5312b650cdbb6ed

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Economics and Econometrics

  1. Stephen Ryan
  2. M. Fowlie
  3. Mar Reguant
  4. Patrick Bajari
  5. S. Houghton
  6. S. Tadelis
  7. O. Williamson
  8. Matthew Gibson

In Marketing

  1. S. Tadelis
  2. S. Houghton
  3. Mar Reguant
  4. Stephen Ryan
  5. Patrick Bajari
  6. M. Fowlie
  7. John Geweke
  8. Hiroshi Ohashi

Citations in the corpus