In this paper we introduce three-valued simple games as a natural extension<br/>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<br/>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<br/>step in at any position later in the processing order....

A cooperative game with non-transferable utility (NTU-game) consists of a collection of payoffsets for the subsets of a nite set of players, for which it has to be determined how much payof each player must receive. The core of an NTU-game consists of all payoffvectors that are in the payoff set...

All over the world intelligence services are collecting data concerning possible terrorist threats. This information is usually transformed into network structures in which the nodes represent the individuals in the data set and the links possible connections between these individuals....

The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced by an arbitrary digraph prescribing the dominance relation among the players, is introduced. It is defined as the average of marginal contribution vectors corresponding to all permutations that do...

We study the model of link formation that was introduced by Aumann and Myerson (1988) and focus on symmetric convex games with transferable utilities. We answer an open question in the literature by showing that in a specific symmetric convex game with six players a structure that results in the...

We examine the strong pairwise stability concept in network formation theory under collective network benefits.Strong pairwise stability considers a pair of players to add a link through mutual consent while permitting them to unilaterally delete any subset of links under their control.We...

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

This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity.

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an order of the players and describes the efficient payoff vector giving the first players in the order their utopia demand as long as it is still possible...