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.     

Virtual utility and the core for games with incomplete information

The core is extended to games with incomplete information. The feasible set is characterized by incentive-compatible mechanisms. Blocking is organized at the interim stage by an incentive-compatible mediation plan. Membership of the blocking coalition itself may be determined randomly by the blocking mediator. Nonemptiness of an interim fine core is proven for games with a balanced structure, independent types, and sidepayments. An offer of severance payments may be needed to inhibit blocking. Core allocations are characterized in terms of virtual-utility scales that generalize the weighted-utility scales of the inner core. Mechanisms that achieve core allocations are coalitionally durable.     

Belief-free equilibria in games with incomplete information: Characterization and existence

We generalize the results of Hörner and Lovo (2009) [15] to N-player games with arbitrary information structure. First, we characterize the set of belief-free equilibrium payoffs under low discounting as the set of feasible payoffs that are individually rational, jointly rational, and incentive compatible. Second, we provide necessary and sufficient conditions on the information structure for this set to be non-empty.     

Cheap talk with two senders and complementary information

This paper studies a cheap talk model in which two senders having partial and non-overlapping private information simultaneously communicate with an uninformed receiver. The sensitivity of the receiverʼs ideal action to one senderʼs private information depends on the other senderʼs private information. We show that the sendersʼ information transmissions exhibit strategic complementarity: more information transmitted by one sender leads to more information being transmitted by the other sender.     

Revisiting games of incomplete information with analogy-based expectations

This paper studies the effects of analogy-based expectations in static two-player games of incomplete information. Players are assumed to be boundedly rational in the way they forecast their opponent's state-contingent strategy: they bundle states into analogy classes and play best-responses to their opponent's average strategy in those analogy classes. We provide general properties of analogy-based expectation equilibria and apply the model to a variety of well known games. We characterize conditions on the analogy partitions for successful coordination in coordination games under incomplete information [Rubinstein, A., 1989. The electronic mail game: Strategic behavior under ‘almost common knowledge’. Amer. Econ. Rev. 79, 385–391], we show how analogy grouping of the receiver may facilitate information transmission in Crawford and Sobel's cheap talk games [Crawford, V.P., Sobel, J., 1982. Strategic information transmission. Econometrica 50, 1431–1451], and we show how analogy grouping may give rise to betting in zero-sum betting games such as those studied to illustrate the no trade theorem.     

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.     

A learning-based model of repeated games with incomplete information

This paper tests a learning-based model of strategic teaching in repeated games with incomplete information. The repeated game has a long-run player whose type is unknown to a group of short-run players. The proposed model assumes a fraction of ‘short-run’ players follow a one-parameter learning model (self-tuning EWA). In addition, some ‘long-run’ players are myopic while others are sophisticated and rationally anticipate how short-run players adjust their actions over time and “teach” the short-run players to maximize their long-run payoffs. All players optimize noisily. The proposed model nests an agent-based quantal-response equilibrium (AQRE) and the standard equilibrium models as special cases. Using data from 28 experimental sessions of trust and entry repeated games, including 8 previously unpublished sessions, the model fits substantially better than chance and much better than standard equilibrium models. Estimates show that most of the long-run players are sophisticated, and short-run players become more sophisticated with experience.     

Computationally restricted unmediated talk under incomplete information

Summary. We show the role of unmediated talk with computational complexity bounds as both an information transmission and a coordination device for the class of two-player games with incomplete information and rational parameters. We prove that any communication equilibrium payoff of such games can be reached as a Bayesian-Nash equilibrium payoff of the game extended by a two phase universal mechanism of interim computationally restricted pre-play communication. The communication protocols are designed with the help of modern cryptographic tools. A familiar context in which our results could be applied is bilateral trading with incomplete information.Received: 9 September 2002, Revised: 14 March 2003, JEL Classification Numbers: C72. Correspondence to: Amparo UrbanoWe wish to thank financial aid from the Valencian Institute of Economic Research (IVIE) and partial support by DIGCYT under project PB95 - 1074. A previous version of this work appears as IVIE Working Paper WP-AD 99-07, under the title: "Unmediated talk under incomplete information".     

Communication in games of incomplete information: Two players

We study the effect of communication in two-person games of incomplete information. We show that for any two-player game of incomplete information, any rational mediated communication mechanism outcome (satisfying a Nash domination condition) can be implemented as the perfect Bayesian equilibrium of a cheap-communication extension of the original game.     

Payoff continuity in incomplete information games: a comment

Kajii and Morris (J. Econ. Theory 82 (1998) 267) provide necessary and sufficient conditions for two priors to be strategically close. The restrictiveness of these conditions establishes that strategic behavior can be highly sensitive to the assumed prior. Their results thus recommend care in the use of priors in economic modelling. Unfortunately, their proof of a central proposition fails for zero probability types. This comment corrects their proof to account for these cases.     

Delay and information aggregation in stopping games with private information

We consider equilibrium timing decisions in a model with a large number of players and informational externalities. The players have private information about a common payoff parameter that determines the optimal time to invest. They learn from each other in real time by observing past investment decisions. We develop new methods of analysis for such large games, and we give a full characterization of symmetric equilibria. We show that the equilibrium statistical inferences are based on an exponential learning model. Although the beliefs converge to truth, learning takes place too late. Ex-ante welfare is strictly between that without observational learning and that with full information.     

Cooperation in Stochastic OLG games

This paper builds on Cremer's (Quart. J. Econ. 101 (1986) 33) seminal analysis which shows that (almost) complete cooperation can be achieved as an equilibrium in a game played by overlapping generations of players if the institution in which players cooperate is infinitely lived.We analyze a similar model in which the costs of cooperation are subject to random shocks. Even if these random shocks are very small, the range of parameters for which cooperation can be sustained is decreased considerably in comparison to the deterministic case. Furthermore, we show how the efficient outcome can be approximated if the level of cooperation can be varied continuously and the cooperation technology has decreasing or constant returns to scale, while this is not possible in the case of increasing returns to scale.     

Large market games with demand uncertainty

We consider a market game with a continuum of consumers, where the measure of each type is stochastic. Nature selects the set of active consumers, who make bids and offers on ?−1 spot market trading posts. Existence of type-symmetric Nash equilibrium is proven. When facing price uncertainty, best responses are unique, and a Nash equilibrium to the sell-all game is typically not a Nash equilibrium to the original game. Under plausible circumstances, consumers strictly prefer to be on one side of the market.     

Communication, correlation and cheap-talk in games with public information

This paper studies extensive form games with public information where all players have the same information at each point in time. We prove that when there are at least three players, all communication equilibrium payoffs can be obtained by unmediated cheap-talk procedures. The result encompasses repeated games and stochastic games.     

Coordination and delay in global games

What is the effect of offering agents an option to delay their choices in a global coordination game? We address this question by considering a canonical binary action global game, and allowing players to delay their irreversible decisions. Those that delay have access to accurate private information at the second stage, but receive lower payoffs. We show that, as noise vanishes, as long as the benefit to taking the risky action early is greater than the benefit of taking the risky action late, the introduction of the option to delay reduces the incidence of coordination failure in equilibrium relative to the standard case where all agents must choose their actions at the same time. We outline the welfare implications of this finding, and probe the robustness of our results from a variety of angles.     

On the existence of pure strategy Nash equilibria in two person discrete games

We construct a generalized two-person discrete strategy static game of complete information where continuity, convexity and compactness cannot be invoked to show the existence of pure strategy Nash equilibrium. We show that, when best responses are unique from both sides, a condition of Minimal Acyclicity is necessary and sufficient for the existence of pure strategy Nash equilibria.     

Nash equilibrium in games with incomplete preferences

Summary. This paper investigates Nash equilibrium under the possibility that preferences may be incomplete. I characterize the Nash-equilibrium-set of such a game as the union of the Nash-equilibrium-sets of certain derived games with complete preferences. These games with complete preferences can be derived from the original game by a simple linear procedure, provided that preferences admit a concave vector-representation. These theorems extend some results on finite games by Shapley and Aumann. The applicability of the theoretical results is illustrated with examples from oligopolistic theory, where firms are modelled to aim at maximizing both profits and sales (and thus have multiple objectives). Mixed strategy and trembling hand perfect equilibria are also discussed.Received: 22 September 2003, Revised: 24 June 2004, JEL Classification Numbers: D11, C72, D43.I would like to thank Jean-Pierre Benôit, Juan Dubra, Alejandrio Jofre, Debraj Ray, Kim-Sau Chung and the seminar participants at NYU and at the Universidad de Chile for their comments. I am most grateful to Efe Ok, for his comments, criticism, suggestions and questions.     

Cheap talk with multiple audiences: An experimental analysis

We examine strategic information transmission in a controlled laboratory experiment of a cheap talk game with one sender and multiple receivers. We study the change in equilibrium behavior from the addition of another audience as well as from varying the degree of conflict between the senderʼs and receiversʼ preferences. We find that, as in cheap talk games with just one receiver, information transmission is higher in games with a separating equilibrium, than in games with only a babbling equilibrium. More interestingly, we find clear evidence that the addition of another audience alters the communication between the sender and the receiver in a way consistent with the theoretical predictions. There is evidence of the presence of agents that are systematically truthful as senders and trusting as receivers: deviations from the theoretical predictions, however, tend to disappear with experience, and learning is faster precisely in the games where deviations are more pronounced.     

Credible assignments can improve efficiency in laboratory public goods games

This paper reports an experiment investigating how assignments improve economic efficiency in a modified version of the standard voluntary-contributions mechanism. The experiment uses a non-binding message that makes common information assignments in the repeated game. A credible assignment is one actually followed by the participants. It turns out to be difficult to credibly assign the symmetric efficient outcome in four person cohorts, but we did discover one assignment that was credible in the last match of the evolutionary repeated game.     

A Blotto game with multi-dimensional incomplete information

We examine a multi-dimensional incomplete information Colonel Blotto game in which each player’s n-tuple of battlefield valuations is drawn from a common n-variate joint distribution function that is uniform on the non-negative orthant of the surface of a sphere.