An assignment situation can be considered as a two-sided market consisting of two disjoint sets of objects.A non-negative reward matrix describes the profit if an object of one group is assigned to an object of the other group. Assuming that each object is owned by a different agent, Shapley and...

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p4 for...

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

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbour games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...

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

We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy-free allocations in economies with indivisible objects, quasi-linear utility functions, and an amount of money.

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

This paper considers situations characterized by a common-pool resource, which needs to be divided among agents. Each of the agents has some claim on this pool and an individual reward function for assigned resources. This paper analyzes not only the problem of max- imizing the total joint...

In this paper we generalise marginal vectors and permutational convexity.We show that if a game is generalised permutationally convex, then the corresponding generalised marginal vector is a core element.Furthermore we refine the concept of permutational convexity and show that this refinement...

Chain-component additive games are graph-restricted superadditive games, where an exogenously given line-graph determines the cooperative possibilities of the players.These games can model various multi-agent decision situations, such as strictly hierarchical organisations or sequencing /...