Abstract
Oblivious equilibrium is a new solution concept for approximating Markov-perfect equilibrium in dynamic models of imperfect competition among heterogeneous firms. In this paper, we present algorithms for computing oblivious equilibrium and for bounding approximation error. We report results from computational case studies that serve to assess both efficiency of the algorithms and accuracy of oblivious equilibrium as an approximation to Markov-perfect equilibrium. We also extend the definition of oblivious equilibrium, originally proposed for models with only firm-specific idiosyncratic random shocks, and our algorithms to accommodate models with industry-wide aggregate shocks. Our results suggest that, by using oblivious equilibrium to approximate Markov-perfect equilibrium, it is possible to greatly increase the set of dynamic models of imperfect competition that can be analyzed computationally.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
