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 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...

The class of Construct and Charge (CC-) rules for minimum cost spanning tree (mcst) situations is considered. CC-rules are defined starting from the notion of charge systems, which specify particular allocation protocols rooted on the Kruskal algorithm for computing an mcst. These protocols can...