We experimentally implement a dynamic public-good problem, where the public good in question is the dynamically evolving information about agents' common state of the world. Subjects' behavior is consistent with free-riding because of strategic concerns. We also find that subjects adopt more...

We design experimental games to evaluate the predictive power of the first cheap‐talk refinement, neologism‐proofness. In our first set of treatments designed to evaluate the refinement with its usual emphasis on literal meanings, we find that a fully revealing equilibrium that is...

We implement multi-sender cheap talk in the laboratory. While full-information transmission is not theoretically feasible in the standard one-sender-one- dimension model, in this setting with more senders and dimensions, full revelation is generically a robust equilibrium outcome. Our...

Static and dynamic games are important tools for the analysis of strategic interactions among economic agents and have found many applications in economics. In many games, equilibria can be described as solutions of polynomial equations. In this paper, we describe state-of-the-art techniques for...

How do families behave dynamically? We provide a framework for studying economic problems in which family behavior is essential. Our key innovation is the inclusion of imperfectly altruistic agents in an otherwise standard consumption-savings problem with exogenous income risk. This gives rise...

We investigate the estimation of models of dynamic discrete-choice games of incomplete information, formulating the maximum-likelihood estimation exercise as a constrained optimization problem that can be solved using state-of-the-art constrained optimization solvers. Under the assumption that...

In dynamic environments where the strategic setting evolves across time, the specific rule governing the transitions can substantially alter the incentives agents face. This is particularly true when history‐dependent strategies are used. In a laboratory study, we examine whether subjects...

Discrete-time stochastic games with a finite number of states have been widely applied to study the strategic interactions among forward-looking players in dynamic environments. These games suffer from a “curse of dimensionality” when the cost of computing players’ expectations over all...

Imposing equilibrium restrictions provides substantial gains in the estimation of dynamic discrete games. Estimation algorithms imposing these restrictions have different merits and limitations. Algorithms that guarantee local convergence typically require the approximation of high-dimensional...

Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...