Game theoretic analysis of sequencing situations has been restricted to manufacturing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs....

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

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 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 maximizing the total joint reward,...

In a resource allocation problem there is a common-pool resource, which has to be divided among agents. Each agent is characterized by a claim on this pool and an individual concave reward function on assigned resources. An assignment of resources is optimal if the total joint reward is...