We analyze the problem of aggregating judgments over multiple issues from the perspective of whether aggregate judgments manage to efficiently use all voters' private information. While new in judgment aggregation theory, this perspective is familiar in a different body of literature about...

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for potential applications of asymmetric unawareness. Applying our unawareness belief structures, we show that the common prior assumption is too weak to rule out...

We study cooperation in economies of indefinite duration. Participants faced a sequence of prisonerʼs dilemmas with anonymous opponents. We identify and characterize the strategies employed at the individual level. We report that (i) grim trigger does not describe well individual play and there...

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.

We study type spaces where a player's type at a state is a conditional probability on the space. We axiomatize these spaces using conditional belief operators, examining three additional axioms of increasing strength. First, introspection, which requires the agent to be unconditionally certain...

In this paper, we introduce a notion of epistemic equivalence between hierarchies of conditional beliefs and hierarchies of lexicographic beliefs, thus extending the standard equivalence results of Halpern (2010) and Brandenburger et al. (2007) to an interactive setting, and we show that there...

In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning...

We discuss the emergence of cooperation in repeated Trust Mini-Games played by finite automata. Contrary to a previous result obtained by Piccione and Rubinstein (1993), we first prove that this repeated game admits two Nash equilibria, a cooperative and a non-cooperative one. Second, we show...

Aumann (1995) showed that for games with perfect information common knowledge of substantive rationality implies backward induction. Substantive rationality is defined in epistemic terms, that is, in terms of knowledge. We show that when substantive rationality is defined in doxastic terms, that...

Costless pre-play communication has been found to effectively facilitate coordination and enhance efficiency in games with Pareto-ranked equilibria. We report an experiment in which two groups compete in a weakest-link contest by expending costly efforts. Allowing intra-group communication leads...