By generalizing the standard solution for 2-person games into n-person cases, this paper develops a new solution concept for cooperative games: the consensus value.We characterize the consensus value as the unique function that satisfies efficiency, symmetry, the quasi dummy property and...

The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on a characterization of the T -value in...

A highway problem is determined by a connected graph which provides all potential entry and exit vertices and all possible edges that can be constructed between vertices, a cost function on the edges of the graph and a set of players, each in need of constructing a connection between a specific...

AMS classifications: 90D12, 90B05.

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine.The costs of an agent depend linearly on the final completion time of his jobs.We describe a procedure that provides an optimal...

AMS classifications: 90A15, 90D12.

A path scheme for a simple game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path.A path scheme is called population monotonic if a player's payoff does not decrease as...

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...