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

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

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

A connected graph G=(V,E), a vertex in V and a non-negative weight function defined on Ecan be used to induce Chinese postman and traveling salesman (cooperative) games. A graph G=(V,E) is said to be locally (respectively, globally) Chinese postman balanced (respectively, totally balanced,...

In this paper we introduce the concept of quasi-building set that may underlie the coalitional structure of a cooperative game with restricted communication between the players. Each feasible coalition, including the set of all players, contains a nonempty subset called the choice set of the...

In this paper, we introduce a general framework for situations with decision making under uncertainty and cooperation possibilities. This framework is based upon a two stage stochastic programming approach. We show that under relatively mild assumptions the cooperative games associated with...

In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a...

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations.In max-RP sequencing situations it is assumed that each player's cost...