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

We experimentally investigate in the laboratory two prominent mechanisms that are employed in school choice programs to assign students to public schools. We study how individual behavior is influenced by preference intensities and risk aversion. Our main results show that (a) the GaleShapley...

We observe that many salient rules to allocate private goods are not only (partially) strategy-proof, but also (partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost sharing, house allocation and auctions, in spite of the...

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

Using the assignment of students to schools as our leading example, we study many-to-one two-sided matching markets without transfers. Students are endowed with cardinal preferences and schools with ordinal ones, while preferences of both sides need not be strict. Using the idea of a competitive...