In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a 'dualize and restrict' procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...

We provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. As it turns out, a cooperative game is convex if and only if all its marginal games are superadditive, and a monotonic game satisfying the veto player property with...

In this paper we provide some technical results related to the Lorenz dominance, which allow to prove that the allocation obtained by the algorithm in Dutta and Ray (1989), when exists, and the elements of the equal split-off set always Lorenz dominate every allocation in the core of the game

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...

This paper defines models of cooperation among players partitioning a completely divisible good (such as a cake or a piece of land). The novelty of our approach lies in the players' ability to form coalitions before the actual division of the good with the aim to maximize the average utility of...

Interval bankruptcy problems arise in situations where an estate has to be liquidated among a fixed number of creditors and uncertainty about the amounts of the estate and the claims is modeled by intervals. We extend in the interval setting the classic results by Curiel, Maschler and Tijs...

This paper examines several monotonicity properties of value-type interval solutions on the class of convex interval games and focuses on the Dutta-Ray (DR) solution for such games. Well known properties for the classical DR solution are extended to the interval setting. In particular, it is...

This paper deals with cost allocation problems arising from connection situations where edge costs are closed intervals of real numbers. To solve such problems, we extend classical solutions from the theory of minimum cost spanning tree games. We study the properties of such solutions and...

In this paper, interval-type solution concepts for interval-valued cooperative games like the interval core, the interval dominance core and stable sets are introduced and studied. The notion of I-balancedness is introduced, and it is proved that the interval core of an interval-valued...

The lexicographic vectors of a balanced game, called here leximals, are used to define a new solution concept, the lexicore, on the cone of balanced games. Properties of the lexicore and its relation with the core on some classes of games are studied. It is shown that on cones of balanced games...