In this study, a dual-interval vertex analysis (DIVA) method is developed, through incorporating the vertex method within an interval-parameter programming framework. The developed DIVA method can tackle uncertainties presented as dual intervals that exist in the objective function and the left-...

In a standard TU-game it is assumed that every subset of the player set N can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure of Aumann and Drèze (1974). They assumed that the player set...

We establish a discrete multivariate mean value theorem for the class of positive maximum component sign preserving functions. A constructive and combinatorial proof is given based upon a simplicial algorithm and vector labeling. Moreover, we apply this theorem to a discrete nonlinear...

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space . It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

On the class of cycle-free directed graph games with transferable utility solution concepts, called web values, are introduced axiomatically, each one with respect to a chosen coalition of players that is assumed to be an anti-chain in the directed graph and is considered as a management team....