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

AMS classification: 90D12;

The new value AL for balanced games is discussed, which is based on averaging of lexicographic maxima of the core.Exactifications of games play a special role to find interesting relations of AL with other solution concepts for various classes of games as convex games, big boss games, simplex...

Inspired by Kalai-Samet [4] and Tijs [11], weighted average lexicographic values are introduced for share sets and for cores of cooperative games using induction arguments. Continuity properties and monotonicity properties of these weighted lexicographic values are studied. For subclasses 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...

AMS classifications: 90D12, 90C05, 90C34.

AMS classifications: 90A15, 90D12.

AMS classifications: 90D12, 90C05.

Relations are established between information sharing (IS) situations and IS-games on one hand and information collecting (IC) situations and IC-games on the other hand. It is shown that IC-games can be obtained as convex combinations of so-called local games. Properties are described which...

This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation,...