In this paper minimum coloring games are considered. We characterize the type of conflict graphs inducing simple or three-valued simple minimum coloring games. We provide an upper bound on the number of maximum cliques of conflict graphs inducing such games. Moreover, a characterization of the...

In this paper we introduce three-valued simple games as a natural extension of simple games. While simple games are used to evaluate single voting systems, three-valued simple games offer the opportunity for a simultaneous analysis of two different voting systems within the same parliamentary...

In this paper a new class of relaxed sequencing games is introduced: the class of Step out -- Step in sequencing games. In this relaxation any player within a coalition is allowed to step out from his position in the processing order and to step in at any position later in the processing order....

In several jurisdictions, commercially exploiting a game of chance (rather than skill) is subject to a licensing regime. It is obvious that roulette is a game of chance and chess a game of skill, but the law does not provide a precise description of where the boundary between the two classes is...

This paper axiomatically studies bankruptcy problems with nontransferable utility by adequately generalizing and analyzing properties for bankruptcy rules. In particular, we discuss several consistency notions and introduce the class of parametric bankruptcy rules. Moreover, we introduce the...

Using network control structures this paper introduces network communication games as a generalization of vertex games and edge games corresponding to communication situations and studies their decomposition into unanimity games. We obtain a relation between the dividends of the network...

This paper studies egalitarianism in the context of nontransferable utility games by introducing and analyzing the egalitarian value. This new solution concept is based on an egalitarian negotiation procedure in which egalitarian opportunities of coalitions are explicitly taken into account. We...

Many cooperative games, especially ones stemming from resource pooling in queuing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is...

In this paper we introduce and analyze the procedural egalitarian solution for transferable utility games. This new concept is based on the result of a coalitional bargaining procedure in which egalitarian considerations play a central role. The procedural egalitarian solution is the first...

This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a...