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.

Market entry situations are modelled, where an entrepreneur has to decide for a collection of markets which market to enter and which not. The entrepreneur can improve his prior information by making use of a group of informants, each of them knowing the situation in one or more markets. For...

A class of cooperative games is introduced which arises from situations in which a set of agents is hierarchically structured and where potential individual economic abilities interfere with the behavioristic rules induced by the organization structure.These games form a cone generated by a...

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 classification: 90D12; 03E72;

This paper shows how problems in `non life'-insurance and `non life'-reinsurance can be modelled simultaneously as cooperative games with stochastic payoffs.Pareto optimal allocations of the risks faced by the insurers and the insureds are determined.It is shown that the core of the...

In this paper we study situations where agents who are divided in hierarchical classes have restricted possibilities for communication. We introduce a class of allocation rules for these situations inspired by the Myerson value (Myerson (1977)) and Shapley values with weight systems (Kalai and...

In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we...

Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class...