Knowledge that Transforms
To make high-quality research more accessible and easier to explore.
Fields:
1014 results
✕ Clear filters
Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes
Potential Pitfalls for the Purchasing-Power-Parity Puzzle? Sampling and Specification Biases in Mean-Reversion Tests of the Law of One Price
The PPP puzzle is based on empirical evidence that international price differences for individual goods (LOOP) or baskets of goods (PPP) appear highly persistent or even nonstationary. The present consensus is these price differences have a half-life that is of the order of five years at best, and infinity at worst. This seems unreasonable in a world where transportation and transaction costs appear so low as to encourage arbitrage and the convergence of price gaps over much shorter horizons, typically days or weeks. However, current empirics rely on a particular choice of methodology, involving (i) relatively low-frequency monthly, quarterly, or annual data, and (ii) a linear model specification. In fact, these methodological choices are not innocent, and they can be shown to bias analysis towards findings of slow convergence and a random walk. Intuitively, if we suspect that the actual adjustment horizon is of the order of days, then monthly and annual data cannot be expected to reveal it. If we suspect arbitrage costs are high enough to produce a substantial “band of inaction,” then a linear model will fail to support convergence if the process spends considerable time random-walking in that band. Thus, when testing for PPP or LOOP, model specification and data sampling should not proceed without consideration of the actual institutional context and logistical framework of markets.
Choosing the Number of Instruments
Properties of instrumental variable estimators are sensitive to the choice of valid instruments, even in large cross-section applications. In this paper we address this problem by deriving simple mean-square error criteria that can be minimized to choose the instrument set. We develop these criteria for two-stage least squares (2SLS), limited information maximum likelihood (LIML), and a bias adjusted version of 2SLS (B2SLS). We give a theoretical derivation of the mean-square error and show optimality. In Monte Carlo experiments we find that the instrument choice generally yields an improvement in performance. Also, in the Angrist and Krueger (1991) returns to education application, when the instrument set is chosen in the way we consider, it turns out that both 2SLS and LIML give similar (large) returns to education.
Nonspeculative Bubbles in Experimental Asset Markets: Lack of Common Knowledge of Rationality vs. Actual Irrationality
We report the results of an experiment designed to study the role of speculation in the formation of bubbles and crashes in laboratory asset markets. In a setting in which speculation is not possible, bubbles and crashes are observed. The results suggest that the departures from fundamental values are not caused by the lack of common knowledge of rationality leading to speculation, but rather by behavior that itself exhibits elements of irrationality. Much of the trading activity that accompanies bubble formation, in markets where speculation is possible, is due to the fact that there is no other activity available for participants in the experiment.
A Parametric Approach to Flexible Nonlinear Inference
This paper proposes a new framework for determining whether a given relationship is nonlinear, what the nonlinearity looks like, and whether it is adequately described by a particular parametric model. The paper studies a regression or forecasting model of the form yt=μ(xt)+εt where the functional form of μ(⋅) is unknown. We propose viewing μ(⋅) itself as the outcome of a random process. The paper introduces a new stationary random field m(⋅) that generalizes finite-differenced Brownian motion to a vector field and whose realizations could represent a broad class of possible forms for μ(⋅). We view the parameters that characterize the relation between a given realization of m(⋅) and the particular value of μ(⋅) for a given sample as population parameters to be estimated by maximum likelihood or Bayesian methods. We show that the resulting inference about the functional relation also yields consistent estimates for a broad class of deterministic functions μ(⋅). The paper further develops a new test of the null hypothesis of linearity based on the Lagrange multiplier principle and small-sample confidence intervals based on numerical Bayesian methods. An empirical application suggests that properly accounting for the nonlinearity of the inflation-unemployment trade-off may explain the previously reported uneven empirical success of the Phillips Curve.
Unobservable Investment and the Hold-Up Problem
We study a two-person bargaining problem in which the buyer may invest and increase his valuation of the object before bargaining. We show that if all offers are made by the seller and the time between offers is small, then the buyer invests efficiently and the seller extracts all of the surplus. Hence, bargaining with frequently repeated offers remedies the hold-up problem even when the agent who makes the relation-specific investment has no bargaining power and contracting is not possible. We consider alternative formulations with uncertain gains from trade or two-sided investment.
Estimating the Return to Schooling: Progress on Some Persistent Econometric Problems
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Representing Preferences with a Unique Subjective State Space
Ž. We extend Kreps’ 1979 analysis of preference for flexibility, reinterpreted by Kreps Ž. 1992 as a model of unforeseen contingencies. We enrich the choice set, consequently obtaining uniqueness results that were not possible in Kreps’ model. We consider several representations and allow the agent to prefer commitment in some contingencies. In the representations, the agent acts as if she had coherent beliefs about a set of possible future Ž. ex post preferences, each of which is an expected-utility preference. We show that this set of ex post preferences, called the subjectie state space, is essentially unique given the restriction that all ex post preferences are expected-utility preferences and is minimal even without this restriction. Because the subjective state space is identified, the way ex post utilities are aggregated into an ex ante ranking is also essentially unique. Hence when a representation that is additive across states exists, the additivity is meaningful in the sense that all representations are intrinsically additive. Uniqueness enables us to show that the size of the subjective state space provides a measure of the agent’s uncertainty about future contingencies and that the way the states are aggregated indicates whether these contingencies lead to a desire for flexibility or commitment.
Stochastic Algorithms, Symmetric Markov Perfect Equilibrium, and the 'curse' of Dimensionality
This paper introduces a stochastic algorithm for computing symmetric Markov perfect equilibria. The algorithm computes equilibrium policy and value functions, and generates a transition kernel for the (stochastic) evolution of the state of the system. It has two features that together imply that it need not be subject to the curse of dimensionality. First, the integral that determines continuation values is never calculated; rather it is approximated by a simple average of returns from past outcomes of the algorithm, an approximation whose computational burden is not tied to the dimension of the state space. Second, iterations of the algorithm update value and policy functions at a single (rather than at all possible) points in the state space. Random draws from a distribution set by the updated policies determine the location of the next iteration's updates. This selection only repeatedly hits the recurrent class of points, a subset whose cardinality is not directly tied to that of the state space. Numerical results for industrial organization problems show that our algorithm can increase speed and decrease memory requirements by several orders of magnitude.