This paper introduces fixed tree games with repeated players (FRP games) which are a generalization of standard fixed tree games.This generalization consists in allowing players to be located in more than one vertex.As a consequence, these players can choose among several ways of connection with...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue.We assume that the agents collaborate in order to achieve an efficient outcome for society.We allow for side-payments and provide a method for obtaining...

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs.It is shown that these sequencing games are convex.

In this paper we study cooperative cost games arising from domination problems on graphs.We introduce three games to model the cost allocation problem and we derive a necessary and su cient condition for the balancedness of all three games.Furthermore we study concavity of these games.

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