We study a cooperative problem where agents contribute a certain amount of money or capital in order to obtain a surplus. The proportional distribution with respect to the contributions of players is a core element of the cooperative game associated. Within this basic model, an external agent is...

Considered here are transferable-utility, coalitional production or market games, featuring differently informed players. It is assumed that personalized contracts must comply with idiosyncratic information. The setting may create two sorts of shadow prices: one for material endowments, the...

Abstract. Exchange of risks is considered here as a transferableutility, cooperative game, featuring risk averse players. Like in competitive equilibrium, a core solution is determined by shadow prices on state-dependent claims. And like in finance, no risk can properly be priced only in terms...

A multi-sided Bohm-Bawerk assignment game (Tejada, to appear) is a model for a multilateral market with a finite number of perfectly complementary indivisible com- modities owned by different sellers, and inflexible demand and support functions. We show that for each such market game there is a...

Singlevalued solutions for the case of twosided market games without product differentiation, also known as B ohmBawerk horse market games, are analyzed. The nucleolus is proved to coincide with the value, and is thus the midpoint of the core. Moreover a characterization of this set of games in...

This paper provides an axiomatic framework to compare the D-core (the set of undominated imputations) and the core of a cooperative game with transferable utility. Theorem 1 states that the D-core is the only solution satisfying projection consistency, reasonableness (from above),...

The paper deals with the subclass of k-convex n-person transferable utility games which have clear affinities to the well-known convex TU-games. Five new characterizations of a k-convex n-person TU-game are presented in terms of: (1) the unanimity coordinates of TU-game with respect to the...

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with nonnegative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of...

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the core of the game. These games will be called buyerseller exact games and satisfy the condition that each mixedpair coalition attains the corresponding matrix...

Different propietats of convex and average convex games are developed in terms of unanimity coordinates. A set of necessary and sufficient conditions for the core of balanced games containing the Shapley value are given. Connections between convexity and average convexity, the Shapley value, the...