Rules of k names are frequently used methods to appoint individuals to office. They are two-stage procedures where a first set of agents, the proposers, select k individuals from an initial set of candidates, and then another agent, the chooser, appoints one among those k in the list. In...

We implement a family of efficient proposals to share benefits generated in environments with externalities. These proposals extend the Shapley value to games with externalities and are parametrized through the method by which the externalities are averaged. We construct two slightly different...

We propose a simple mechanism that implements the Ordinal Shapley Value (Prez-Castrillo and Wettstein [2005]) for economies with three or less agents.

In this paper, we suggest a simple sequential mechanism whose subgame perfect equilibria give rise to efficient networks. Moreover, the payoffs received by the agents coincide with their Shapley value in an appropriately defined cooperative game.

This paper studies many-to-one matching markets where each student is assigned to a hospital. Each hospital has possibly multiple positions and responsive preferences. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant...

Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the...

In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence to Nash equilibria, and present a number of possibility and impossibility results. Basically, we show that if in...