Recursive robust estimation and control without commitment

In a Markov decision problem with hidden state variables, a posterior distribution serves as a state variable and Bayes’ law under an approximating model gives its law of motion. A decision maker expresses fear that his model is misspecified by surrounding it with a set of alternatives that are nearby when measured by their expected log likelihood ratios (entropies). Martingales represent alternative models. A decision maker constructs a sequence of robust decision rules by pretending that a sequence of minimizing players choose increments to martingales and distortions to the prior over the hidden state. A risk sensitivity operator induces robustness to perturbations of the approximating model conditioned on the hidden state. Another risk sensitivity operator induces robustness to the prior distribution over the hidden state. We use these operators to extend the approach of Hansen and Sargent [Discounted linear exponential quadratic Gaussian control, IEEE Trans. Automat. Control 40(5) (1995) 968-971] to problems that contain hidden states.     

The strategic value of recall

This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results ( [Lehrer, 1988] and [Neyman and Okada, 2009]) on repeated games with bounded recall. We provide an explicit formula for the asymptotic value of the repeated game as a function of the one-stage game, the duration of the repeated game, and the recall of the agents.     

Unmediated communication in games with complete and incomplete information

We study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^U(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available and players exchange private or public messages that do not affect directly their payoffs. We first show that if G is a game of complete information with five or more players and rational parameters, then S^U(G) coincides with the set of correlated equilibria of G. Next, we demonstrate that if G is a game of incomplete information with at least five players, rational parameters and full support (i.e., all profiles of types have positive probability), then S^U(G) is equal to the set of communication equilibria of G.     

Decentralized learning from failure

We study decentralized learning in organizations. Decentralization is captured through Crawford and Haller's [Learning how to cooperate: optimal play in repeated coordination games, Econometrica 58 (1990) 571-595] attainability constraints on strategies. We analyze a repeated game with imperfectly observable actions. A fixed subset of action profiles are successes and all others are failures. The location of successes is unknown. The game is played until either there is a success or the time horizon is reached. We partially characterize optimal attainable strategies in the infinite horizon game by showing that after any fixed time, agents will occasionally randomize while at the same time mixing probabilities cannot be uniformly bounded away from zero.     

Local coordination and market equilibria

We reformulate the local stability analysis of market equilibria in a competitive market as a local coordination problem in a market game, where the map associating market prices to best-responses of all traders is common knowledge and well-defined both in and out of equilibrium. Initial expectations over market variables differ from their equilibrium values and are not common knowledge. This results in a coordination problem as traders use the structure of the market game to converge back to equilibrium. We analyse a simultaneous move and a sequential move version of the market game and explore the link with local rationalizability.     

Coordination of mobile labor

We study coordination failures in many simultaneously occurring coordination problems. Players encounter one of the problems but have the outside option of migrating to one of the remaining ones. Drawing on the global games approach, we show that such a mobile game has a unique equilibrium that allows us to examine comparative statics. The endogeneity of the outside option value and of the migration activity leads to non-monotonicity of welfare with respect to mobility friction; high mobility may hurt players. We apply these “general equilibrium’’ findings to the problem of the labor market during industrialization as described by Matsuyama [Increasing returns, industrialization and indeterminacy of equilibrium, Quart. J. Econ. 106 (1991) 617-650].     

Stochastic games with information lag

Two-player zero-sum stochastic games with finite state and action spaces are known to have undiscounted values. We study such games under the assumption that one or both players observe the actions of their opponent after some time-dependent delay. We develop criteria for the rate of growth of the delay such that a player subject to such an information lag can still guarantee himself in the undiscounted game as much as he could have with perfect monitoring. We also demonstrate that the player in the Big Match with the absorbing action subject to information lags that grows too rapidly will not be able to guarantee as much as he could have in the game with perfect monitoring.     

What to maximize if you must

The assumption that decision makers choose actions to maximize their preferences is a central tenet in economics, often justified formally or informally by appealing to evolutionary arguments. In contrast, we show that in almost every game and for almost every family of distortions of a player's actual payoffs, some degree of this distortion is beneficial to the player, and will not be driven out by any evolutionary process involving payoff-monotonic selection dynamics. Consequently, under any such selection dynamics the population will not converge to payoff-maximizing behavior. We also show that payoff-maximizing behavior need not prevail when preferences are imperfectly observed.     

Incorporating rigidity and commitment in the timing structure of macroeconomic games

This paper proposes a novel framework that generalizes the timing structure of games. Building on alternating move games and models of rational inattention, the players' actions may be rigid, i.e., infrequent. This rigidity in the timing of moves makes the game more dynamic and asynchronous, acting as a commitment mechanism. Therefore, it can enhance cooperation and often eliminate inefficient equilibrium outcomes present in the static (normal form) game. Interestingly, (i) this can happen even in a finite game (possibly as short as two periods) and (ii) without reputation building. Furthermore, (iii) the required degree of commitment may be under some circumstances arbitrarily low and under others infinitely high. Our main example comes from macroeconomics in which various rigidities have played a central role. Investigating the Kydland–Prescott–Barro–Gordon monetary policy game, we derive the necessary and sufficient degree of long-term policy commitment to low inflation under which the influential time-inconsistency problem is eliminated.     

Sequential equilibrium in monotone games: A theory-based analysis of experimental data

A monotone game is an extensive-form game with complete information, simultaneous moves and an irreversibility structure on strategies. It captures a variety of situations in which players make partial commitments and allows us to characterize conditions under which equilibria result in socially desirable outcomes. However, since the game has many equilibrium outcomes, the theory lacks predictive power. To produce stronger predictions, one can restrict attention to the set of sequential equilibria, or Markov equilibria, or symmetric equilibria, or pure-strategy equilibria. This paper explores the relationship between equilibrium behavior in a class of monotone games, namely voluntary contribution games, and the behavior of human subjects in an experimental setting. Several key features of the symmetric Markov perfect equilibrium (SMPE) are consistent with the data. To judge how well the SMPE fits the data, we estimate a model of Quantal Response Equilibrium (QRE) [R. McKelvey, T. Palfrey, Quantal response equilibria for normal form games, Games Econ. Behav. 10 (1995) 6-38; R. McKelvey, T. Palfrey, Quantal response equilibria for extensive form games, Exp. Econ. 1 (1998) 9-41] and find that the decision rules of the QRE model are qualitatively very similar to the empirical choice probabilities.     

Iterated potential and robustness of equilibria

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies such a procedure to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an iterated MP-maximizer is robust to incomplete information [A. Kajii, S. Morris, The robustness of equilibria to incomplete information, Econometrica 65 (1997) 1283-1309] and absorbing and globally accessible under perfect foresight dynamics for a small friction [A. Matsui, K. Matsuyama, An approach to equilibrium selection, J. Econ. Theory 65 (1995) 415-434]. Several simple sufficient conditions under which a game has an iterated MP-maximizer are also provided.     

Preference for Flexibility and Dynamic Consistency

Dekel, Lipman, and Rustichini [3] characterize preferences over menus of lotteries that can be represented by the use of a unique subjective state space and a prior. We investigate what would be the appropriate version of Dynamic Consistency in such a setup. The condition we find, which we call Flexibility Consistency, is linked to a comparative theory of preference for flexibility. When the subjective state space is finite, we show that Flexibility Consistency is equivalent to a subjective version of Dynamic Consistency and that it implies that the decision maker is a subjective state space Bayesian updater. Later we characterize when a collection of signals can be interpreted as a partition of the subjective state space of the decision maker.     

The swing voter's curse with adversarial preferences

We analyze voting behavior in a large electorate in which voters have adversarial state-contingent preferences with incomplete information about the state of the world. We show that one type of voter can suffer from the swing voter's curse à la Feddersen and Pesendorfer [The swing voter's curse, Amer. Econ. Rev. 86 (1996) 408-424], and go on to characterize the symmetric Nash equilibria of this model under different parameter values. We prove that unlike settings with nonadversarial preferences, there are equilibria in which in one state of the world, a minority-preferred candidate almost surely wins the election and thus the election may fail to correctly aggregate information. Indeed, we show that the fraction of the electorate dissatisfied with the result can be as large as .     

Sowing Doubt Optimally in Two-Person Repeated Games

Consider a two-person repeated game, where one of the players, P1, can sow doubt, in the mind of his opponent, as to what P1's payoffs are. This results in a two-person repeated game with incomplete information. By sowing doubt, P1 can sometimes increase his minimal equilibrium payoff in the original game. We prove that this minimum is maximal when only one payoff matrix, the negative of the payoff matrix of the opponent, is added (the opponent thus believes that he might play a zero-sum game). We obtain two formulas for calculating this maximal minimum payoff. Journal of Economic Literature Classification Numbers: C7, D8.     

Behavioral spillovers and cognitive load in multiple games: An experimental study

We present evidence from laboratory experiments of behavioral spillovers and cognitive load that spread across strategic contexts. In the experiments, subjects play two distinct games simultaneously with different opponents. We find that the strategies chosen and the efficiency of outcomes in one game depends on the other game that the subject plays, and that play is altered in predictable directions. We develop a measure of behavioral variation in a normal form game, outcome entropy, and find that prevalent strategies in games with low outcome entropy are more likely to be used in the games with high outcome entropy, but not vice versa. Taken together, these findings suggest that people do not treat strategic situations in isolation, but may instead develop heuristics that they apply across games.     

Trees and extensive forms

This paper addresses the question of what it takes to obtain a well-defined extensive form game. Without relying on simplifying finiteness or discreteness assumptions, we characterize the class of game trees for which all pure strategy combinations induce unique outcomes. The generality of the set-up covers “exotic” cases, like stochastic games or decision problems in continuous time (differential games). We find that the latter class, though a well-defined problem, fails this test.     

Correlated Nash equilibrium

We modify the epistemic conditions for Nash equilibrium only to accommodate Gilboa and Schmeidler's [I. Gilboa, D. Schmeidler, Maxmin expected utility with nonunique prior, J. Math. Econ. 18 (1989) 141-153] maxmin expected utility preferences, and identify the equilibrium concept in n-player strategic games that characterizes the modified epistemic conditions. The epistemic characterization supports the equilibrium concept as a minimal generalization of Nash equilibrium, in the sense that it deviates from Nash equilibrium only in terms of players' attitude towards ambiguity. Consequently, comparing it with Nash equilibrium constitutes a ceteris paribus study of the effects of ambiguity on how a game is played. For example, with ambiguity, (beliefs about) action choices are in general correlated.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

Competitive behavior in market games: Evidence and theory

We explore whether competitive outcomes arise in an experimental implementation of a market game, introduced by Shubik (1973) [21]. Market games obtain Pareto inferior (strict) Nash equilibria, in which some or possibly all markets are closed. We find that subjects do not coordinate on autarkic Nash equilibria, but favor more efficient Nash equilibria in which all markets are open. As the number of subjects participating in the market game increases, the Nash equilibrium they achieve approximates the associated competitive equilibrium of the underlying economy. Motivated by these findings, we provide a theoretical argument for why evolutionary forces can lead to competitive outcomes in market games.     

Committing to transparency to resist corruption

This paper studies firms' incentives to commit to transparent behavior in a competitive procedure modeled as an asymmetric information beauty contest managed by a corrupt agent. In his evaluation of firms' offers for a public contract the agent has some discretion to favor a firm in exchange for a bribe. While unilateral commitment to transparency is never incentive compatible, under some circumstances a voluntary but conditional commitment mechanism can eliminate corruption. A low quality firm may prefer not to commit only when the agent's discretion is strong and the market's profitability is small. In that situation, the high quality firms commit when commitment decisions are kept secret, but some conditions on firms' beliefs are required when commitment decisions are publicly announced. A mechanism combining both conditionality and a reward (a transparent selection advantage that needs not be large) allows complete elimination of corruption.