Information transmission in coalitional voting games

A core allocation of a complete information economy can be characterized as one that would not be unanimously rejected in favor of another feasible alternative by any coalition. We use this test of coalitional voting in an incomplete information environment to formalize a notion of resilience. Since information transmission is implicit in the Bayesian equilibria of such voting games, this approach makes it possible to derive core concepts in which the transmission of information among members of a coalition is endogenous. Our results lend support to the credible core of Dutta and Vohra [Incomplete information, credibility and the core, Math. Soc. Sci. 50 (2005) 148-165] and the core proposed by Myerson [Virtual utility and the core for games with incomplete information, Mimeo, University of Chicago, 2005] as two that can be justified in terms of coalitional voting.     

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.     

Dynamic coalitional equilibrium

We study coalition formation processes of Konishi and Ray (2003) [27]. It is shown that an absorbing and deterministic process of coalition formation that also forms an equilibrium - satisfies a coalitional one-deviation property - does exist if one allows the process to be history dependent. All such dynamic equilibrium processes of coalition formation are characterized. Absorbing outcomes of dynamic equilibrium processes are also identified. It is shown that they always constitute a subset of the largest consistent set of Chwe (1994) [11]. A procedure that identifies a dynamic equilibrium process of coalition formation in finite time is constructed.     

Hierarchies of ambiguous beliefs

We present a theory of interactive beliefs analogous to Mertens and Zamir [Formulation of Bayesian analysis for games with incomplete information, Int. J. Game Theory 14 (1985) 1-29] and Brandenburger and Dekel [Hierarchies of beliefs and common knowledge, J. Econ. Theory 59 (1993) 189-198] that allows for hierarchies of ambiguity. Each agent is allowed a compact set of beliefs at each level, rather than just a single belief as in the standard model. We propose appropriate definitions of coherency and common knowledge for our types. Common knowledge of coherency closes the model, in the sense that each type homeomorphically encodes a compact set of beliefs over the others’ types. This space universally embeds every implicit type space of ambiguous beliefs in a beliefs-preserving manner. An extension to ambiguous conditional probability systems [P. Battigalli, M. Siniscalchi, Hierarchies of conditional beliefs and interactive epistemology in dynamic games, J. Econ. Theory 88 (1999) 188-230] is presented. The standard universal type space and the universal space of compact continuous possibility structures are epistemically identified as subsets.     

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.     

A note on Kuhn’s Theorem with ambiguity averse players

Kuhn’s Theorem shows that extensive games with perfect recall can equivalently be analyzed using mixed or behavioral strategies, as long as players are expected utility maximizers. This note constructs an example that illustrates the limits of Kuhn’s Theorem in an environment with ambiguity averse players who use a maxmin decision rule and full Bayesian updating.     

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.     

Dynamic group formation in the repeated prisoner?s dilemma

We consider dynamic group formation in repeated n-person prisoner?s dilemma. Agreements in coalitional bargaining are self-binding in that they are supported as subgame perfect equilibria of repeated games. Individuals are allowed to renegotiate the cooperating group agreement through a process of voluntary participation. We prove that a cooperating group forms as an absorbing state of a Markov perfect equilibrium after a finite number of renegotiations if and only if the group is Pareto efficient, provided that individuals are patient. The cooperating group can only expand.     

On the informational efficiency of simple scoring rules

We study information aggregation in large elections. With two candidates, efficient information aggregation is possible (e.g., Feddersen and Pesendorfer [5], [6] and [7]). We show that this result does not extend to elections with more than two candidates. We study a class of simple scoring rules in voting games with Poisson population uncertainty and three candidates. No simple scoring rule aggregates information efficiently, even if preferences are dichotomous and a Condorcet winner always exists. We introduce a weaker criterion of informational efficiency that requires a voting rule to have at least one efficient equilibrium. Only approval voting satisfies this criterion.     

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.     

Proposal power and majority rule in multilateral bargaining with costly recognition

This paper studies a sequential bargaining model in which agents expend efforts to be the proposer. In equilibrium, agents’ effort choices are influenced by the prize and cost effects. The (endogenous) prize is the difference between the residual surplus an agent obtains when he is the proposer and the payment he expects to receive when he is not. Main results include: (1) under the unanimity voting rule, two agents with equal marginal costs propose with equal probabilities, regardless of their time preferences; (2) under a nonunanimity rule, however, the more patient agent proposes with a greater probability; (3) while, under the unanimity rule, the social cost decreases in group heterogeneity, it can increase under a nonunanimity rule; and (4) when agents are identical, the unanimity rule is socially optimal.     

Agreeable bets with multiple priors

This paper considers a two-agent model of trade with multiple priors. Firstly, we characterize the existence of an agreeable bet on some event in terms of the set of priors. It is then shown that the existence of an agreeable bet on some event is a strictly stronger condition than the existence of an agreeable trade, whereas the two conditions are equivalent in the standard Bayesian framework. Secondly, we show that the two conditions are equivalent when the set of priors is the core of a convex capacity. These results are also related to the no trade theorems under asymmetric information.     

Bayesian learning and convergence to Nash equilibria without common priors

Summary. Consider an infinitely repeated game where each player is characterized by a “type” which may be unknown to the other players in the game. Suppose further that each player's belief about others is independent of that player's type. Impose an absolute continuity condition on the ex ante beliefs of players (weaker than mutual absolute continuity). Then any limit point of beliefs of players about the future of the game conditional on the past lies in the set of Nash or Subjective equilibria. Our assumption does not require common priors so is weaker than Jordan (1991); however our conclusion is weaker, we obtain convergence to subjective and not necessarily Nash equilibria. Our model is a generalization of the Kalai and Lehrer (1993) model. Our assumption is weaker than theirs. However, our conclusion is also weaker, and shows that limit points of beliefs, and not actual play, are subjective equilibria. Received: March 3, 1995; revised version: February 17, 1997     

Risk taking under heterogenous revenue sharing

We examine the impact of informal risk sharing on risk taking incentives when transfers are organized through a social network. A bilateral partial sharing rule satisfies that neighbors share equally a part of their revenue. In such a society, correlated technologies generate interdependent risk levels. We obtain three findings. First, there is a unique and interior Nash-equilibrium risk profile, and it is in general differentiated and related to the Bonacich measure of the risk sharing network. Second, more revenue sharing enhances risk taking on average, although some agents may lower their risk level. Last, we find that under investment might often be observed.     

Gambling in contests

This paper presents a strategic model of risk-taking behavior in contests. Formally, we analyze an n-player winner-take-all contest in which each player decides when to stop a privately observed Brownian motion with drift. A player whose process reaches zero has to stop. The player with the highest stopping point wins. Unlike the explicit cost for a higher stopping time in a war of attrition, here, higher stopping times are riskier, because players can go bankrupt. We derive a closed-form solution of a Nash equilibrium outcome. In equilibrium, highest expected losses occur at an intermediate negative value of the drift.     

Uncertainty, co-ordination and path dependence

Our objective is to assess whether dynamics hinder or assist co-ordination in a game with strategic complementarities. We study two dynamic aspects: different agents make decisions at different points in time; and extra information about a payoff-relevant state of nature becomes available over time. We find that the dynamic resolution of information matters most for uniqueness of equilibrium. This is demonstrated by showing that the condition for uniqueness is weaker when learning occurs. We also analyse how successfully agents co-ordinate when there is a unique equilibrium. Finally, we show that path dependence occurs: the order in which signals arrive matters, as well as the total amount of information received.     

Decision time and steps of reasoning in a competitive market entry game

Entry decisions in market entry games usually depend on the belief about how many others are entering the market, the belief about the own rank in a real effort task, and subjects’ risk preferences. In this paper I am able to replicate these basic results and examine two further dimensions: (i) the level of strategic sophistication, which has a positive impact on entry decisions, and (ii) the impact of time pressure, which has a (partly) negative influence on entry rates. Furthermore, when ranks are determined using a real effort task, differences in entry rates are explainable by higher competitiveness of males. Additionally, I show that individual characteristics are more important for the entry decision in more competitive environments.     

Risk attitudes and the stag-hunt game

A stag-hunt game (with the risky and safe actions) has two pure Nash equilibria that are Pareto-rankable. The risky action leads either to the Pareto-superior equilibrium (high payoff) or to out of equilibrium (low payoff) depending on the opponent’s action. Both players may want to obtain high payoff but uncertainty about the opponent’s action may prevent them to take such strategic risk. This paper investigates how information about the risk attitude of an opponent affects a player’s action choice in the stag-hunt game. I find that although a subject’s propensity to choose the risky action depends on her opponent’s risk attitude, it does not depend on her own risk attitude.