Extensions to Oblivious Equilibrium

نویسندگان

  • C. Lanier Benkard
  • Benjamin Van Roy
  • Gabriel Y. Weintraub
چکیده

In a recent paper, Weintraub, Benkard, and Van Roy (2007b) propose an approximation method for analyzing Ericson and Pakes (1995)-style dynamic models of imperfect competition. In that paper, we defined a new notion of equilibrium, oblivious equilibrium (henceforth, OE), in which each firm is assumed to make decisions based only on its own state and knowledge of the long run average industry state, but where firms ignore current information about competitors’ states. The great advantage of OE is that they are much easier to compute than are Markov perfect equilibria (henceforth, MPE). Moreover, we showed that an OE provides meaningful approximations of long-run Markov perfect dynamics of an industry with many firms if, alongside some technical requirements, the equilibrium distribution of firm states obeys a light-tail condition. To facilitate using OE in practice, in Weintraub, Benkard, and Van Roy (2007a) we provide a computational algorithm for solving for OE, and approximation bounds that can be computed to provide researchers with a numerical measure of how close OE is to MPE in their particular application. We also provided computational evidence supporting the conclusion that OE often yields good approximations of MPE behavior for industries like those that empirical researchers would like to study. While our computational results suggest that OE will be useful in many applications on its own, we believe that a major contribution of OE will be as a starting point with which to build even better approximations. As a matter of fact, in Weintraub, Benkard, and Van Roy (2007a) we extend our base model as well as algorithms for computing OE and error bounds to incorporate aggregate shocks common to all firms. Such an extension is important, for example, when analyzing the dynamic effects of industry-wide business cycles. In this note we introduce other important extensions to OE.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniqueness of Oblivious Equilibrium in Dynamic Discrete Games∗

The recently introduced concept of oblivious equilibrium aims at approximating Markov-Perfect Nash Equilibria (MPNE) when its calculation is computationally prohibitive in Ericson-Pakes-style games with many players. This paper examines and extends the oblivious equilibrium concept to dynamic discrete choice games. We consider a set of assumptions commonly posed in the applied dynamic games lit...

متن کامل

Computational Methods for Oblivious Equilibrium

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 ob...

متن کامل

Oblivious equilibrium for concentrated industries

This paper explores the application of oblivious equilibrium to concentrated industries. We define an extended notion of oblivious equilibrium that we call partially oblivious equilibrium (POE) that allows for there to be a set of “dominant firms”, whose firm states are always monitored by every other firm in the market. We perform computational experiments that show that POE are often close to...

متن کامل

Duality for vector equilibrium problems with constraints

‎In the paper‎, ‎we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior‎. ‎Then‎, ‎their applications to optimality conditions for quasi-relative efficient solutions are obtained‎. ‎Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...

متن کامل

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. As secure computation becomes more practical, the need for practical large scale oblivious transfer protocols is becoming more evident. Oblivious transfer extensions are protocols that enable a relatively small number of “base-OTs” t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007