We study a model of retrospective search in which an agent--a researcher, an online shopper, or a politician--tracks the value of a product. Discoveries beget discoveries and their observations are correlated over time, which we model using a Brownian motion. The agent, a standard exponential...

We evaluate dynamic oligopoly estimators with laboratory data. Using a stylized en-try/exit game, we estimate structural parameters under the assumption that the data are generated by a Markov-perfect equilibrium (MPE) and use the estimates to predict counterfactual behavior. The concern is that...

The foundations of incomplete contracts have been questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of subgame perfect implementation to the introduction of small amounts of asymmetric information. We show that...

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and robustness properties of various strategies. In particular, we consider best-response bidding strategies...

We study the efficiency of oligopoly equilibria in a model where firms compete over capacities and prices. The motivating example is a communication network where service providers invest in capacities and then compete in prices. Our model economy corresponds to a two-stage game. First, firms...

Recently, empirical industrial organization economists have proposed estimators for dynamic games of incomplete information. In these models, agents choose from a finite number actions and maximize expected discounted utility in a Markov perfect equilibrium. Previous econometric methods estimate...

We propose an approximation method for analyzing Ericson and Pakes (1995)-style dynamic models of imperfect competition. We develop a simple algorithm for computing an ``oblivious equilibrium,'' in which each firm is assumed to make decisions based only on its own state and knowledge of the long...

Continuous-time stochastic games with a finite number of states have substantial computational and conceptual advantages over the more common discrete-time model. In particular, continuous time avoids a curse of dimensionality and speeds up computations by orders of magnitude in games with more...

This paper considers the problem of estimating the distribution of payoffs in a discrete dynamic game, focusing on models where the goal is to learn about the distribution of firms' entry and exit costs. The idea is to begin with non parametric first stage estimates of entry and continuation...

This paper studies the identification problem in infinite horizon Markovian games and proposes a generally applicable estimation method. Every period firms simultaneously select an action from a finite set. We characterize the set of Markov equilibria. Period profits are a linear function of...