In this paper, we consider a finite set of agents with commonly known full-support priors on the fundamental space of uncertainty. Then, we show that if the hierarchies of conditional beliefs á la Battigalli and Siniscalchi (1999) are derived from these priors, then all types of the same agent...

We investigate the relations between different types of perfect equilibrium, introduced by Simon and Stinchcombe (1995) for games with compact action spaces and continuous payoffs. Simon and Stinchcombe distinguish two approaches to perfect equilibrium in this context, the classical "trembling...

We prove that every multi-player Borel game with bounded and lower-semi-continuous payoffs admits a subgame-perfect epsilon-equilibrium in pure strategies. This result complements Example 3 in Solan and Vieille (2003), which shows that a subgame-perfect epsilon-equilibrium in pure strategies...

In this paper we formalize the notion of lexicographic belief hierarchies in standard partitional models (Aumann, 1976). We introduce the notion of epistemic equivalence between two belief space, and show that the state space representation of lexicographic belief hierarchies is equivalent to...

Democratic decision-making is often defended on grounds of the ''wisdom of crowds'': decisions are more likely to be correct if they are based on many independent opinions, so a typical argument in social epistemology. But what does it mean to have independent opinions? Opinions can be...

The contemporary theory of epistemic democracy often draws on the Condorcet Jury Theorem to formally justify the `wisdom of crowds''. But this theorem is inapplicable in its current form, since one of its premises---voter independence---is notoriously violated. This premise carries...

The paper proposes necessary and sufficient conditions for the natural implementation of(efficient) social choice correspondences (SCCs) in pure finite exchange economies when some ofthe agents are partially honest. A partially honest agent is an agent who strictly prefers to tellthe truth when...

We prove the existence of a subgame-perfect epsilon-equilibrium, for every epsilon 0, in a classof multi-player games with perfect information, which we call free transition games. The noveltyis that a non-trivial class of perfect information games is solved for subgame-perfection, withmultiple...

Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of...

In this survey we analyze, and compare, various sufficient epistemic conditions for backward induction that have been proposed in the literature. To this purpose we present a simple epistemic base model for games with perfect information, and translate the different models into the language of...