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, the classical theory of two-person cooperative games is extended to two-person cooperative games with interval uncertainty. The core, balancedness, superadditivity and related topics are studied. Solutions are introduced and characterizations are given

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

In this paper, convex interval games are introduced and some characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for...

In this paper we consider one-machine sequencing situations with interval data. We present different possible scenarioes and extend classical results on well known rules and on sequencing games to the interval setting

This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity

Standard solutions for TU-games assign to every TU-game a payoff vector. However, if there is uncertainty about the payoff allocation then we cannot just assign a specific payoff to every player. Therefore, in this paper we introduce interval solutions for TU-games which assign to every TU-game...