Inductive reasoning about unawareness

We develop a model of games with awareness that allows for differential levels of awareness. We show that, for the standard modal-logical interpretations of belief and awareness, a player cannot believe there exist propositions of which he is unaware. Nevertheless, we argue that a boundedly rational individual may regard the possibility that there exist propositions of which she is unaware as being supported by inductive reasoning, based on past experience and consideration of the limited awareness of others. In this paper, we provide a formal representation of inductive reasoning in the context of a dynamic game with differential awareness. We show that, given differential awareness over time and between players, individuals can derive inductive support for propositions expressing their own unawareness. We consider the ecological rationality of heuristics to guide decisions in problems involving differential awareness.     

Universal type structures with unawareness

Infinite hierarchies of awareness and beliefs arise in games with unawareness, similarly to belief hierarchies in standard games. A natural question is whether each hierarchy describes the playerʼs awareness of the hierarchies of other players and beliefs over these, or whether the reasoning can continue indefinitely. This paper constructs the universal type structure with unawareness where each type has an awareness level and a belief over types. Countable hierarchies are therefore sufficient to describe all uncertainty in games with unawareness.     

Information structures with unawareness

I construct a state space model with unawareness following [R.J. Aumann, Agreeing to disagree, Ann. Stat. 76 (1976) 1236-1239]. Dekel et al. [E. Dekel, B.L. Lipman, A. Rustichini, Standard state-space models preclude unawareness, Econometrica 66 (1998) 159-173] show that standard state space models are incapable of representing unawareness. The model circumvents the impossibility result by endowing the agent with a subjective state space that differs from the full state space when he has the unawareness problem. Information is modeled as a pair, consisting of both factual information and awareness information. The model preserves the central properties of the standard information partition model.     

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.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Dynamic unawareness and rationalizable behavior

We define generalized extensive-form games which allow for asymmetric awareness of actions. We extend Pearceʼs (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties, and prove existence.     

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.     

Learning to alternate

The Individual Evolutionary Learning (IEL) model explains human subjects’ behavior in a wide range of repeated games which have unique Nash equilibria. Using a variation of ‘better response’ strategies, IEL agents quickly learn to play Nash equilibrium strategies and their dynamic behavior is like that of humans subjects. In this paper we study whether IEL can also explain behavior in games with gains from coordination. We focus on the simplest such game: the 2 person repeated Battle of Sexes game. In laboratory experiments, two patterns of behavior often emerge: players either converge rapidly to one of the stage game Nash equilibria and stay there or learn to coordinate their actions and alternate between the two Nash equilibria every other round. We show that IEL explains this behavior if the human subjects are truly in the dark and do not know or believe they know their opponent’s payoffs. To explain the behavior when agents are not in the dark, we need to modify the basic IEL model and allow some agents to begin with a good idea about how to play. We show that if the proportion of inspired agents with good ideas is chosen judiciously, the behavior of IEL agents looks remarkably similar to that of human subjects in laboratory experiments.     

The evolution of conventions under incomplete information

Summary. We formulate an evolutionary learning process with trembles for static games of incomplete information. For many games, if the amount of trembling is small, play will be in accordance with the games (strict) Bayesian equilibria most of the time. This supports the notion of Bayesian equilibrium. Often the process will select a specific equilibrium. We study an extension to incomplete information of the prototype conflict known as Chicken and find that the equilibrium selection by evolutionary learning may well be in favor of inefficient Bayesian equilibria where some types of players fail to coordinate.Received: 17 March 2003, Revised: 3 December 2003, JEL Classification Numbers: C72.     

Robustness to strategic uncertainty

We introduce a criterion for robustness to strategic uncertainty in games with continuum strategy sets. We model a player's uncertainty about another player's strategy as an atomless probability distribution over that player's strategy set. We call a strategy profile robust to strategic uncertainty if it is the limit, as uncertainty vanishes, of some sequence of strategy profiles in which every player's strategy is optimal under his or her uncertainty about the others. When payoff functions are continuous we show that our criterion is a refinement of Nash equilibrium and we also give sufficient conditions for existence of a robust strategy profile. In addition, we apply the criterion to Bertrand games with convex costs, a class of games with discontinuous payoff functions and a continuum of Nash equilibria. We show that it then selects a unique Nash equilibrium, in agreement with some recent experimental findings.     

Knightian games and robustness to ambiguity

This paper introduces a notion of robustness to ambiguous beliefs for Bayesian Nash equilibria. An equilibrium is robust if the corresponding strategies remain approximately optimal for a class of games with ambiguous beliefs that results from an appropriately defined perturbation of the belief structure of the original non-ambiguous belief game. The robustness definition is based on a novel definition of equilibrium for games with ambiguous beliefs that requires equilibrium strategies to be approximate best responses for all measures that define a player's belief. Conditions are derived under which robustness is characterized by a newly defined strategic continuity property, which can be verified without reference to perturbations and corresponding ambiguous belief games.     

Existence of equilibria in countable games: An algebraic approach

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Waldʼs pick-the-larger-integer game. Several authors have provided conditions for the existence of equilibria in infinite games. These conditions are typically of topological nature and are rarely applicable to countable games. Here we establish an existence result for the equilibrium of countable games when the strategy sets are a countable group, the payoffs are functions of the group operation, and mixed strategies are not requested to be σ-additive. As a byproduct we show that if finitely additive mixed strategies are allowed, then Waldʼs game admits an equilibrium. Finally we extend the main results to uncountable games.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Competitive equilibrium with unawareness in economies with production

This paper investigates an extension of the GEI-unawareness framework by Modica et al. (Econ. Theory 12 (1998) 259) to economies with entrepreneurial production. Existence of equilibrium is guaranteed given decreasing returns to scale. Firm's value and investment decision in equilibrium are characterized. An example of commodity innovation shows that the effect of different degrees of awareness on investment decisions depend upon the degree of risk aversion. In the case of log preferences unawareness may not matter for commodity innovation, although this depends on other preference features.     

Learning across games

This paper studies the learning process carried out by two agents who are involved in many games. As distinguishing all games can be too costly (require too much reasoning resources) agents might partition the set of all games into categories. Partitions of higher cardinality are more costly. A process of simultaneous learning of actions and partitions is presented and equilibrium partitions and action choices characterized. Learning across games can destabilize strict Nash equilibria even for arbitrarily small reasoning costs and even if players distinguish all the games at the stable point. The model is also able to explain experimental findings from the traveler?s dilemma and deviations from subgame perfection in bargaining games.     

Meaning and Credibility in Cheap-Talk Games

I define neologism-proofness, a refinement of perfect Bayesian equilibrium in cheap-talk games. It applies when players have a preexisting common language, so that an unexpected message′s literal meaning is clear, and only credibility restricts communication. I show that certain implausible equilibria are not neologism-proof; in some games, no equilibrium is. Journal of Economic Literature classification numbers: D83 D82 C73.     

Exploitable actions of believers in the “law of small numbers” in repeated constant-sum games

In repeated fixed-pair constant-sum games with unique equilibria in mixed strategies, such as matching pennies, the subgame perfect equilibrium is repeating the stage-game mixed-strategy equilibrium action. In such games rational players avoid strategies that are exploitable, in that current actions either deviate systematically from the equilibrium action probabilities or fail to be serially independent of past actions. I revisit classic experiments and find that subjects’ actions are sometimes exploitable because they are serially dependent. Subjects have difficulty in producing serially independent actions and in recognizing serially dependent sequences due to a bias called local representativeness.     

Strategic knowledge sharing in Bayesian games

This paper provides a model for the study of direct, public and strategic knowledge sharing in Bayesian games. We propose an equilibrium concept which takes into account communication possibilities of exogenously certifiable statements and in which beliefs off the equilibrium path are explicitly deduced from consistent possibility correspondences, without making reference to perturbed games. Properties of such an equilibrium and of revised knowledge are examined. In particular, it is shown that our equilibrium is always a sequential equilibrium of the associated extensive form game with communication. Finally, sufficient conditions for the existence of perfectly revealing or non-revealing equilibria are characterized in some classes of games. Several examples and economic applications are investigated.     

Bilateral commitment

We consider non-cooperative environments in which two players have the power to gradually and unilaterally rule out some of their actions. Formally, we embed a strategic-form game into a multi-stage game, in which players can restrict their action spaces in all but the final stage, and select among the remaining actions in the last stage. We say that an action profile is implementable by commitment if this action profile is played in the last stage of a subgame-perfect equilibrium path. We provide a complete characterization of all implementable action profiles and a simple method to find them. It turns out that the set of implementable profiles does not depend on the length of the commitment process. We show, furthermore, that commitments can have social value in the sense that in some games there are implementable action profiles that dominate all Nash equilibria of the original game.     

A characterization of strategic complementarities

I characterize games for which there is an order on strategies such that the game has strategic complementarities. I prove that, with some qualifications, games with a unique equilibrium have complementarities if and only if Cournot best-response dynamics has no cycles; and that all games with multiple equilibria have complementarities. As applications of my results, I show that: (1) generic 2×2 games either have no pure-strategy equilibria, or have complementarities; (2) generic two-player finite ordinal potential games have complementarities.