We study random assignment economies with expected-utility agents, each of them eventually obtaining a single object. Inspired on Hylland and Zeckhauser’s (1979) Pseudomarket mechanism (PM) and on a serial dictatorship, we introduce the Sequential Pseudomarket (SP) where groups of agents...

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

We propose a new solution concept to address the problem of sharing a surplus among the agents generating it. The problem is formulated in the preferences-endowments space. The solution is defined recursively, incorporating notions of consistency and fairness and relying on properties satisfied...

We present a model in which an individual's sentiments toward others are determined endogenously on the basis of how they perform relative to the societal average. This, in turn, affects the individual's own behavior and hence other agent's sentiments toward her. We focus on stationary patterns...

We present a model in which each agent's sentiments toward others are determined endogenously on the basis of how they behave relative to a standard of appropriate behavior. As sentiments change, so too does the optimal behavior of each individual, which in turn affects other agents' sentiments...

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...

We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)s assignment game. We consider the Core, three other notions of group stability and two alternative definitions of competitive equilibrium. We show that (i) each group stable set is...

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payo¤s. We then...

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange,...