This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Furthermore, level-increase monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element of...

Trees with revenues are a generalization of standard trees. In a tree with revenues, players have to pay for their connections to the root, but a player can also earn some revenue from being connected to the root. In this paper, we present an algorithm for calculating the nucleolus. Copyright...

Trees with revenues are a generalization of standard trees. In a tree with revenues, players have to pay for their connections to the root, but a player can also earn some revenue from being connected to the root. In this paper, we present an algorithm for calculating the nucleolus. Copyright...

On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is...