A 2law of scarcity2 is that scarceness is rewarded. We demonstrate laws of scarcity for cores and approximate cores of games. Furthermore, we demonstrate conditions under which all payoffs in the core of any game in a parametized collection have an equal treatment property and show that equal...

A "law of scarcity" is that scarceness is rewarded. We demonstrate laws of scarcity for cores and approximate cores of games. Furthermore, we show that equal treatment core payout vectors satisfy a condition of cyclic monotonicity. Our results are developed for parameterized collections of games...

We introduce the framework of parameterized collections of games with and without sidepayments and provide three nonemptiness of approximate core theorems. The parameters bound (a) the number of approximate types of players and the size of the approximation and (b) the size of nearly effective...

The "law of scarcity" is that scarceness is rewarded; recall, for example, the diamonds and water paradox. In this paper, furthering research initiated in Kelso and Crawford (1982, Econometrica 50, 1483-1504) for matching models, we demonstrate a law of scarcity for cores and approximate cores of...

We consider parameterized collections of games without side payments and determine a bound on epsilon so that all suffciently large games in the collection have non-empty epsilon-cores. Our result makes explicit the relationship between the required size of epsilon for non-emptiness of the...

The “law of scarcity” is that scarceness is rewarded ; recall, for example, the diamonds and water paradox. In this paper, furthering research initiated in Kelso and Crawford (1982, Econometrica 50, 1483-1504) for matching models, we demonstrate a law of scarcity for cores and approximate...

We introduce the framework of parameterized collections of games with and without side payments and provide three no emptiness of approximate core theorems for games in parameterized collections. The parameters bound (a) the number of approximate types of players and the size of the...

We introduce the framework of parameterized collections of games and provide three nonemptiness of approximate core theorems for arbitrary games with and without sidepayments. The parameters bound (a) the number of approx-imate types of players and the size of the approximation and (b) the size...