The type-agent core is a new solution concept for exchange economies with asymmetric information. It coincides with the set of equilibrium outcomes of a simple competitive screening game. Uninformed intermediaries help the agents to cooperate in an attempt to make some profit. The paper extends...

I prove that the Nash bargaining solution is the only solution to satisfy 'Disagreement Point Convexity' and 'Midpoint Domination.' I explain how this improves previous results obtained by Chun (1990) and by Dagan et al. (2002)

Each period, a principal must assign one of two agents to a new task. Profit is stochastically higher when the agent is qualified for the task, but the principal cannot observe qualification. Her only decision is which of the two agents to assign, if any, given the public history of selections...

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games to determine whether the core of the combined game coincides with the sum of...

We first observe that two of Maskin's results do not extend beyond three players: we construct a four-player partition function with nonpositive externalities whose unique solution is inefficient, as well as a four-player characteristic function that has a unique efficient solution for each...

Bounded rationality theories are typically characterized over exhaustive data sets. We develop a methodology to understand the empirical content of such theories with limited data, adapting the classic, revealed-preference approach to new forms of revealed information. We apply our approach to...

Each period, a principal must assign one of two agents to a new task. Profit is stochastically higher when the agent is qualified for the task, but the principal cannot observe qualification. Her only decision is which of the two agents to assign, if any, given the public history of selections...