related system of games that explicitly models the underlying cooperative process.Specific solution concepts are proposed. …

This paper analyzes processing problems and related cooperative games.In a processing problem there is a finite set of … game summarizes the minimal joint costs for every coalition.It turns out that processing games are totally balanced …

This paper analyzes the compromise social choice correspondence derived from the F-value of digraph games.Among other …

In this paper we introduce a new family of compromise solutions for the class of compromise admissible games …

In this paper we study hedonic games where each player views every other player either as a friend or as an enemy … games.Moreover, an element of the strong core under friends appreciation can be found in polynomial time, while finding an …

coincide with the T value of two corresponding TU games.We apply our solutions to a real-life case of allocating university …

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 …, network communication games also allow to consider both the vertices and the edges of the graph as players, leading to a new …

, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative …

redefining corresponding NTU-bankruptcy games in a tailor-made way. It is shown that NTU-bankruptcy games are both coalitional … (TU) games to NTU-games, we also show that each NTU-bankruptcy game is compromise stable. Thus, NTU-bankruptcy games are … shown to retain the two characterizing properties of TU-bankruptcy games: convexity and compromise stability. As a first …

. Furthermore, full characteriz ations of games for which a k-core cover is nonempty and for which a k-core cover coincides with the …