Each of n = 1 identical buyers (and m = 1 identical sellers) wants to buy (sell) a single unit of an indivisible good. The core predicts a unique and extreme outcome: the entire surplus is split evenly among the buyers when m n and among the sellers when m n; the long side gets nothing. We...

This paper considers a frictional market where buyers and sellers, with unit demand and supply, search for trading opportunities. The analysis focuses on explicit search frictions, allows for two-sided incomplete information, and puts no restriction on agent heterogeneity. In this context, a...

We provide a new proof of the non-emptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their "balanced cover games", which are non-empty, can be...

Aguiar et al. (2018) propose the Shapley distance as a measure of the extent to which output sharing among the stakeholders of an organization can be considered unfair. It measures the distance between an arbitrary pay profile and the Shapley pay profile under a given technology, the latter...

In this paper we considered the classical Shapley-Scarf (1974) "house allocation model", where in addition there is a perfectly divisible good (money). The problem is to characterize all strategy-proof, nonbossy and individually rational allocation mechanisms. The finding is that only a...

A fair division problem with indivisible objects, e.g. jobs, and one divisible good (money) is considered. The individuals consume one object and money. The class of strategy-proof and fair allocation rules is characterized. The allocation rules in the class are like a Vickrey auction bossy and...