This paper studies repeated moral hazard in teams. Agents' actions are observable to each other but not to the principal. For any given dynamic contract, agents always select their favorite subgame perfect equilibrium in the corresponding dynamic game. The optimal dynamic contract must take that...

Truthful revelation of preferences has emerged as a desideratum in the design of school choice programs. Gale-Shapley's deferred acceptance mechanism is strategy-proof for students but limits their ability to communicate their preference intensities. This results in ex-ante inefficiency when...

A central issue in school choice is the design of a student assignment mechanism. Education literature provides guidance for the design of such mechanisms but does not offer specific mechanisms. The flaws in the existing school choice plans result in appeals by unsatisfied parents. We formulate...

This paper first shows that when colleges' preferences are substitutable there does not exist any stable matching mechanism that makes truthful revelation of preferences a dominant strategy for every student. The paper introduces student types and captures colleges' preferences for affirmative...

A group of friends consider renting a house but they shall first agree on how to allocate its rooms and share the rent. We propose an auction mechanism for room assignment-rent division problems which mimics the market mechanism. Our auction mechanism is efficient, envy-free,...

This paper employs a dynamic general equilibrium model to design and evaluate long-term unemployment insurance plans (plans that depend on workers' unemployment history) in economies with and without hidden savings. We show that optimal benefit schemes and welfare implications differ...

We study trust, reciprocity and favors in a repeated trust game with private information. In our main analysis, players are willing to exhibit trust and thereby facilitate cooperative gains only if such behavior is regarded as a favor that must be reciprocated, either immediately or in the...

. . .

Many refinements of Nash equilibrium yield solution correspondences that do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a...