To make high-quality research more accessible and easier to explore.

Fields:
2 results ✕ Clear filters

Bayesian Networks and Boundedly Rational Expectations *

Quarterly Journal of Economics 2016 131(3), 1243-1290 open access
I present a framework for analyzing decision making under imperfect understanding of correlation structures and causal relations. A decision maker (DM) faces an objective long-run probability distribution p over several variables (including the action taken by previous DMs). The DM is characterized by a subjective causal model, represented by a directed acyclic graph over the set of variable labels. The DM attempts to fit this model to p , resulting in a subjective belief that distorts p by factorizing it according to the graph via the standard Bayesian network formula. As a result of this belief distortion, the DM’s evaluation of actions can vary with their long-run frequencies. Accordingly, I define a ”personal equilibrium” notion of individual behavior. The framework enables simple graphical representations of causal-attribution errors (such as coarseness or reverse causation), and provides tools for checking rationality properties of the DM’s behavior. I demonstrate the framework’s scope of applications with examples covering diverse areas, from demand for education to public policy.

Search Design and Broad Matching

American Economic Review 2016 106(3), 563-586 open access
We study decentralized mechanisms for allocating firms into search pools. The pools are created in response to noisy preference signals provided by consumers, who then browse the pools via costly random sequential search. Surplus-maximizing search pools are implementable in symmetric Nash equilibrium. Full extraction of the maximal surplus is implementable if and only if the distribution of consumer types satisfies a set of simple inequalities, which involve the relative fractions of consumers who like different products and the Bhattacharyya coefficient of similarity between their conditional signal distributions. The optimal mechanism can be simulated by a keyword auction with broad matching.