We describe the construction and analysis of asymmetric Cost Sharing mechanisms, in which a variety of axioms are applied to subsets of the agents/goods. We show that the analysis can be quite subtle as apparently similar axiomatizations lead to significantly different results; in particular,...

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...

A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation. Based on this insight, we formulate the...

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...

We consider the “airport problem”, which is concerned with sharing the cost of an airstrip among agents who need airstrips of different lengths. We investigate the implications of two properties, Left-endpoint Subtraction (LS) bilateral consistency and LS converse consistency, in the airport...

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 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...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso–Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firmsʼ reports following Milgrom (2010). We show...

Several labor markets, including the job market for new Ph.D. economists, have recently developed formal signaling mechanisms. We show that such mechanisms are harmful for some environments. While signals transmit previously unavailable information, they also facilitate information asymmetry...