Rationalizable implementation

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict version of the monotonicity condition introduced by Maskin is necessary under the solution concept of rationalizability. Assuming the social choice function is responsive, i.e. in distinct states it selects distinct outcomes, we show that strict Maskin monotonicity is also sufficient under a mild “no worst alternative” condition. In particular, no economic condition is required. We discuss how our results extend when the social choice function is not responsive.     

Strong rationalizability for two-player noncooperative games

Summary. The paper introduces a version of rationalizability that ignores strategies that are supported by negligible sets of beliefs, where a negligible set is one whose Lebesgue measure is zero. The theory is developed solely for the special case of point rationalizability; conditions are then derived under which point rationalizability entails no loss of generality. When these conditions obtain, the predictions yielded by this approach are often (although not always) a significant reduction over what is predicted by rationalizability. Received: September 10 1996; revised version: July 18, 1997     

Strategic Rationality Orderings and the Best Rationalization Principle

In a finite game fix a space of extended probabilities over strategies and a profile of best response correspondences. A profile ofrationality orderingsis then given by an ordered partition of the set of strategies of each player, representing different degrees of rationality, where at-leastk+1-rational strategies are best responses against extended probabilities reflecting at leastkdegrees of rationality. This solution can be constructed inductively, providing a Bayesian foundation for controversial deletion procedures such as extensive form rationalizability and iterated weak dominance. Focusing on extensive games, this approach formalizes the best rationalization principle.Journal of Economic LiteratureClassification Number: C72.     

Theories of coalitional rationality

This paper generalizes the concept of best response to coalitions of players and offers epistemic definitions of coalitional rationalizability in normal form games. The (best) response of a coalition is defined to be an operator from sets of conjectures to sets of strategies. A strategy is epistemic coalitionally rationalizable if it is consistent with rationality and common certainty that every coalition is rational. A characterization of this solution set is provided for operators satisfying four basic properties. Special attention is devoted to an operator that leads to a solution concept that is generically equivalent to the iteratively defined concept of coalitional rationalizability.     

The equivalence of the Dekel–Fudenberg iterative procedure and weakly perfect rationalizability

Summary. Two approaches have been proposed in the literature to refine the rationalizability solution concept: either assuming that a player believes that with small probability her opponents choose strategies that are irrational, or assuming that their is a small amount of payoff uncertainty. We show that both approaches lead to the same refinement if strategy perturbations are made according to the concept of weakly perfect rationalizability, and if there is payoff uncertainty as in Dekel and Fudenberg [J. of Econ. Theory 52 (1990), 243–267]. For both cases, the strategies that survive are obtained by starting with one round of elimination of weakly dominated strategies followed by many rounds of elimination of strictly dominated strategies. Received: 10 December 1998; revised version: 26 April 1999     

ROBUST RATIONALIZABILITY UNDER ALMOST COMMON CERTAINTY OF PAYOFFS

An action is robustly rationalizable if it is rationalizable for every type who has almost common certainty of payoffs. We illustrate by means of an example that an action may not be robustly rationalizable even if it is weakly dominant, and argue that robust rationalizability is a very stringent refinement of rationalizability. Nonetheless, we show that every strictly rationalizable action is robustly rationalizable. We also investigate how permissive robust rationalizability becomes if we require that players be fully certain of their own payoffs.     

Coherent behavior in noncooperative games

A new concept of mutually expected rationality in noncooperative games is proposed: joint coherence. This is an extension of the “no arbitrage opportunities” axiom that underlies subjective probability theory and a variety of economic models. It sheds light on the controversy over the strategies that can reasonably be recommended to or expected to arise among Bayesian rational players. Joint coherence is shown to support Aumann's position in favor of objective correlated equilibrium, although the common prior assumption is weakened and viewed as a theorem rather than an axiom. An elementary proof of the existence of correlated equilibria is given, and relationships with other solution concepts (Nash equilibrium, independent and correlated rationalizability) are also discussed.     

Higher order game dynamics

Continuous-time game dynamics are typically first order systems where payoffs determine the growth rate of the players? strategy shares. In this paper, we investigate what happens beyond first order by viewing payoffs as higher order forces of change, specifying e.g. the acceleration of the players? evolution instead of its velocity (a viewpoint which emerges naturally when it comes to aggregating empirical data of past instances of play). To that end, we derive a wide class of higher order game dynamics, generalizing first order imitative dynamics, and, in particular, the replicator dynamics. We show that strictly dominated strategies become extinct in n-th order payoff-monotonic dynamics n   orders as fast as in the corresponding first order dynamics; furthermore, in stark contrast to first order, weakly dominated strategies also become extinct for n?2$n?2$. All in all, higher order payoff-monotonic dynamics lead to the elimination of weakly dominated strategies, followed by the iterated deletion of strictly dominated strategies, thus providing a dynamic justification of the well-known epistemic rationalizability process of Dekel and Fudenberg [7]. Finally, we also establish a higher order analogue of the folk theorem of evolutionary game theory, and we show that convergence to strict equilibria in n-th order dynamics is n orders as fast as in first order.     

Chernoff's dual axiom,revealed preference and weak rational choice functions

A new and a weaker concept of rationalizability is introduced and its implications on the properties of individual choice are investigated. Especially, (i) it is shown that a property of choice functions, called Chernoff's dual axiom in this paper, plays a crucial role for the rationality of choice, and (ii) weakening the concept of rationalizability facilitates characterization of revealed preference relations.     

On p-rationalizability and approximate common certainty of rationality

This paper shows that common p-belief of rationality implies p-rationalizability for games with compact strategy sets. We also establish the Bayesian foundation for the perfect p-rationalizability for finite games. The p-rationalizability is then used to analyze the robustness of rationalizable sets. For any game with compact strategy sets, we show that the rationalizable set is robust, i.e., the strategies characterized by common p-belief of rationality are close to the rationalizable set when p→1.     

Preparation

A product set of pure strategies is a prep set (‘prep’ is short for ‘preparation’) if it contains at least one best reply to any consistent belief that a player may have about the strategic behavior of his opponents. Minimal prep sets are shown to exist in a class of strategic games satisfying minor topological conditions. The concept of minimal prep sets is compared with (pure and mixed) Nash equilibria, rationalizability, minimal curb sets, and persistent retracts.     

Monotone equilibria in Bayesian games of strategic complementarities

For Bayesian games of strategic complementarities, we provide a constructive proof of the existence of a greatest and a least Bayesian Nash equilibrium, each one in strategies that are monotone in type. Our main assumptions, besides strategic complementarities, are that each player's payoff displays increasing differences in own action and the profile of types and that each player's interim beliefs are increasing in type with respect to first-order stochastic dominance (e.g., types are affiliated). The result holds for general action and type spaces (single-, multi-, or infinite-dimensional; continuous or discrete) and no prior is assumed. We also provide the following comparative statics result: the greatest and least equilibria are higher if there is a first-order stochastic dominant shift in the interim beliefs. We apply this result to strategic information revelation in games of voluntary disclosure.     

Mechanism design with multidimensional, continuous types and interdependent valuations

We consider the mechanism design problem when agents’ types are multidimensional and continuous, and their valuations are interdependent. If there are at least three agents whose types satisfy a weak correlation condition, then for any decision rule and any ?>0 there exist balanced transfers that render truthful revelation a Bayesian ?-equilibrium. A slightly stronger correlation condition ensures that there exist balanced transfers that induce a Bayesian Nash equilibrium in which agents’ strategies are nearly truthful.     

Forecasting the US real house price index: Structural and non-structural models with and without fundamentals

We employ a 10-variable dynamic structural general equilibrium model to forecast the US real house price index as well as its downturn in 2006:Q2. We also examine various Bayesian and classical time-series models in our forecasting exercise to compare to the dynamic stochastic general equilibrium model, estimated using Bayesian methods. In addition to standard vector-autoregressive and Bayesian vector autoregressive models, we also include the information content of either 10 or 120 quarterly series in some models to capture the influence of fundamentals. We consider two approaches for including information from large data sets — extracting common factors (principle components) in factor-augmented vector autoregressive or Bayesian factor-augmented vector autoregressive models as well as Bayesian shrinkage in a large-scale Bayesian vector autoregressive model. We compare the out-of-sample forecast performance of the alternative models, using the average root mean squared error for the forecasts. We find that the small-scale Bayesian-shrinkage model (10 variables) outperforms the other models, including the large-scale Bayesian-shrinkage model (120 variables). In addition, when we use simple average forecast combinations, the combination forecast using the 10 best atheoretical models produces the minimum RMSEs compared to each of the individual models, followed closely by the combination forecast using the 10 atheoretical models and the DSGE model. Finally, we use each model to forecast the downturn point in 2006:Q2, using the estimated model through 2005:Q2. Only the dynamic stochastic general equilibrium model actually forecasts a downturn with any accuracy, suggesting that forward-looking microfounded dynamic stochastic general equilibrium models of the housing market may prove crucial in forecasting turning points.     

Collusion as public monitoring becomes noisy: Experimental evidence

This paper uses laboratory experiments to test the implications of the theory of repeated games on equilibrium payoffs and estimate strategies in an infinitely repeated prisoners' dilemma game with imperfect public monitoring. We find that subjects' payoffs (i) decrease as noise increases, and (ii) are lower than the theoretical maximum for low noise, but exceed it for high noise. Under the assumption that the subjects' strategy uses thresholds on the public signal for transition between cooperation and punishment states, we find that the best fitting strategy simply compares the most recent public signal against a single threshold.     

Unobserved heterogeneity and equilibrium: an experimental study of Bayesian and adaptive learning in normal form games

We describe an experiment based on a simple two-person game designed so that different learning models make different predictions. Econometric analysis of the experimental data reveals clear heterogeneity in the subjects’ learning behavior. But the subjects follow only a few decision rules for basing their play on their information, and these rules have simple cognitive interpretations. There is a unique equilibrium in pure strategies, and many equilibria in mixed strategies. We find that the only equilibrium consistent with the data is one of the mixed strategy equilibria. This equilibrium is shown, surprisingly, to be consistent with Jordan's Bayesian model.     

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.     

A testable model of consumption with externalities

This paper presents a nonparametric model of interdependent preferences, where an individual's consumption may act as an externality on the preferences of other consumers. We assume that individual price consumption data is observed for all consumers. It is known that the general consumption model with externalities imposes few restrictions on the observed data, where the consistency requirement is Nash rationalizability. We motivate potential games as an important sub class of games where the family of concave potential games is refutable and imposes stronger restrictions on observed data. We use this framework to extend the analysis of Brown and Matzkin [D. Brown, R. Matzkin, Testable restrictions on the equilibrium manifold, Econometrica 64 (1996) 1249-1262] on refutable pure exchange economies to pure exchange economies with externalities. Finally, we discuss an application of this model to inter-household consumption data.     

Conservative belief and rationality

Playersʼ beliefs may be incompatible, in the sense that player i can assign probability 1 to an event E to which player j assigns probability 0. One way to block incompatibility is to assume a common prior. We consider here a different approach: we require playersʼ beliefs to be conservative, in the sense that all players must ascribe the actual world positive probability. We show that common conservative belief of rationality (CCBR) characterizes strategies in the support of a subjective correlated equilibrium where all playersʼ beliefs have common support. We also define a notion of strong rationalizability, and show that it is characterized by CCBR.     

Interim Bayesian Nash equilibrium on universal type spaces for supermodular games

We prove the existence of a greatest and a least interim Bayesian Nash equilibrium for supermodular games of incomplete information. There are two main differences from the earlier proofs and from general existence results for non-supermodular Bayesian games: (a) we use the interim formulation of a Bayesian game, in which each player's beliefs are part of his or her type rather than being derived from a prior; (b) we use the interim formulation of a Bayesian Nash equilibrium, in which each player and every type (rather than almost every type) chooses a best response to the strategy profile of the other players. There are no restrictions on type spaces and action sets may be any compact metric lattices.