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.

This paper analyses Chinese postman games with repeated players, which generalize Chinese postman games by dropping the one-to-one relation between edges and players. In our model, we allow players to own more than one edge, but each edge belongs to at most one player. The one-to-one relation...

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

For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is...

This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a...

This paper introduces a new class of interactive cooperative purchasing situations and provides an explicit alternative characterization of the nucleolus of cooperative games, which offers an alternative to Kohlberg (1971). In our cooperative purchasing situation, the unit price of a commodity...

A Chinese postman (CP) game is induced by a a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this...

This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...

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

Much research focuses on development of new agricultural technologies to reduce poverty levels of the large population of smallholder farms in Sub Saharan Africa. In this paper we argue that smallholders can also increase their production in a different way, namely by using their resources more...