We consider a market with indivisible objects, called houses, and money. On this market, each house is initially owned (or rented) by some agent and each agent demands precisely one house. The problem is to identify the complete set of direct allocation mechanisms that can be used to reallocate...

We analyze the problem of allocating indivisible objects and monetary compensations to a set of agents. In particular, we consider envy-free and budget-balanced rules that are least manipulable with respect to agents counting or with respect to utility gains. A key observation is that, for any...

We analyze a college admissions game with asymmetric information between students and colleges. Students' preferences for colleges depend on the observable quality of the schools. In contrast, colleges' preferences for students depend on the latter's abilities, which are private information....

In this paper, we establish sufficient conditions on the domain of preferences and agents' behavior in order to characterize the existence of stable assignments in many-to-one matching problems with externalities. The set of stable matchings depends on what agents believe other agents will do if...

In this paper, we develop a new game theoretic network centrality measure based on the Shapley value. To do so, we consider a coalitional game, where the worth of each coalition is the total play in the game introduced in Ballester et al. (2006). We first establish that the game is convex. As a...

This paper studies an extensive form game of coalition formation with random proposers in games with externalities. It is shown that an agreement will be reached without delay if any set of coalitions profits from merging. Even under this strong condition, the equilibrium coalition structure is...

The Nash program is an important research agenda initiated in Nash (Econometrica 21:128-140, 1953) in order to bridge the gap between the noncooperative and cooperative counterparts of game theory. The program is thus turning sixty-seven years old, but I will argue it is not ready for...

This paper studies a noncooperative allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Dagan et al. (1997) for bankruptcy problems. According to it, a player, the proposer, makes a proposal that the remaining players must accept or...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

This chapter surveys the sizable and growing literature on coalition formation. We refer to theories in which one or more groups of agents (“coalitions”) deliberately get together to jointly determine their actions. The defining idea of a coalition, in this chapter, is that of a group which...