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

We consider the problem of computing the influence of a neuronal structure in a brain network. Abraham, Kotter, Krumnack, and Wanke (2006) computed this influence by using the Shapley value of a coalitional game corresponding to a directed network as a rating. Kotter, Reid, Krumnack, Wanke, and...

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