The standard state-spaces of asymmetric information preclude non- trivial forms of unawareness (Dekel, Lipman and Rustichini, 1998). We introduce a generalized state-space model that allows for non-trivial unawareness among several individuals, and which satisfies strong properties of knowledge...

Heifetz, Meier and Schipper (2005) introduced a generalized state-space model that allows for non-trivial unawareness among several individuals and strong properties of knowledge. We show that this generalized state-space model arises naturally if states consist of maximally consistent sets of...

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for many potential applications of asymmetric unawareness. We develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are...

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for many potential applications of asymmetric unawareness. We develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are...

Heifetz, Meier and Schipper (2005) introduced a generalized state-space model that allows for non-trivial unawareness among several individuals and strong properties of knowledge. We show that this generalized state-space model arises naturally if states consist of maximally consistent sets of...

The standard state-spaces of asymmetric information preclude non- trivial forms of unawareness (Dekel, Lipman and Rustichini, 1998). We introduce a generalized state-space model that allows for non-trivial unawareness among several individuals, and which satisfies strong properties of knowledge...

Everyone remembers a plot where a disadvantaged individual facing the prospect of failure, spends more effort, turns around the game and wins unexpectedly. Most tournament theories, however, predict the opposite pattern and see the disadvantaged agent investing less effort. We show that ’turn...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

A network payoff function assigns a utility to all participants in a (social) network. In this paper we discuss properties of such network payoff functions that guarantee the existence of certain types of pairwise stable networks and the convergence of certain network formation processes. In...