The Shapley-Ichiishi result states that a game is convex if and only if the convex hull of marginal vectors equals the core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same core structure. We then associate a system of linear...

The process of computing the nucleolus of arbitrary utility games is notoriously hard. A number of papers have appeared in which the nucleolus is computed by an algorithm in which either one or a huge number of huge linear programs have to be solved. We show that on the class of veto-rich games,...

The paper presents a framework in which the most important single-valued solutions in the literature of TU games are jointly analyzed. None of the main results is original.

Lucas and Trall (1963) defined the games in partition function form as a generalization of the cooperative games with transferable utility. In our work we propose by means of an axiomatic characterization a solution for such games in partition function form. This solution will be a...

This paper introduces a new class of games, highway games, which arise from situations where there is a common resource that agents will jointly use. That resource is an ordered set of several indivisible sections, where each section has an associated fixed cost and each agent requires some...