We propose a simple model in which agents are matched in pairs in order to complete a task of unit size. The preferences of agents are single-peaked and continuous on the amount of time they devote to it. Our model combines features of two models: assignment games (Shapley and Shubik (1971)) and...

We study the problem of an organization that has a large number of potential tasks and has to choose which tasks to handle and which pair of experts assign to each of them. We propose a mechanism that generates a Pareto-efficient assignment in the weak core and is group strategy-proof. The...

We report evidence from an experiment where a principal chooses an agent out of two to perform a task for a fixed compensation. The principal's payoff depends on the agent's ex-ante ability and on a non-contractible effort that the agent has to exert once employed. We find that a significant...

Games with imperfect information often feature multiple equilibria, which depend on beliefs off the equilibrium path. Standard selection criteria such as passive beliefs, symmetric beliefs or wary beliefs rest on ad hoc restrictions on beliefs. We propose a new selection criterion that imposes...

We analyze the consequences of illegally residing in a country on the likelihood of reporting a crime to the police and, as a consequence, on the likelihood to become victims of a crime. We use an immigration amnesty to address two issues when dealing with the legal status of immigrants: it is...

Given the advantages of specialization, employers encourage their employees to acquire distinct expertise to better satisfy clients' needs. However, when the client is unaware of the employees' expertise and cannot be sorted out to the most competent employee by means of a gatekeeper, a mismatch...