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 modular games is a set of generators of the distributive lattice of all …

assignment games. …

solution concept for market games. For different solution concepts a syndicate can be disadvantageous and there is no escape to … on a self-interesting link between multi-sided Bohm-Bawerk as- signment games and bankruptcy games (ONeill, 1982). We … identify a particular subset of Bohm-Bawerk assignment games and we show that it is isomorphic to the whole class of bankruptcy …

matched with seller j, the market produces aij units of utility. We study Monge assignment games, that is bilateral … cooperative assignment games where the assignment matrix satisfies the Monge property. These matrices can be characterized by the …

In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the … payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those …

We extend Rochfords (1983) notion of symmetrically pairwise-bargained equilibrium to assignment games with more than …-sided assignment games, the set of SMB is always nonempty and that, unlike the two-sided case, it does not coincide in general with the …

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that … this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also …

Cooperative TU-games with large core were introduced by Sharkey (1982) and the concept of Population Monotonic … monotonic core giving a characterization for three-player games. In this paper we prove that all games with large monotonic core …