A generalized linear production model: A unifying model

We introduce a generalized linear production model whose attractive feature being that the resources held by any subset of producersS is not restricted to be the vector sum of the resources held by the members ofS. We provide sufficient conditions for the non-emptiness of the core of the associated generalized linear production game, and show that if the core of the game is not empty then a solution in it can be produced from a dual optimal solution to the associated linear programming problem. Our generalized linear production model is a proper generalization of the linear production model introduced by Owen, and it can be used to analyze cooperative games which cannot be studied in the ordinary linear production model framework. We use the generalized model to show that the cooperative game induced by a network optimization problem in which players are the nodes of the network has a non-empty core. We further employ our model to prove the non-emptiness of the core of two other classes of cooperative games, which were not previously studied in the literature, and we also use our generalized model to provide an alternative proof for the non-emptiness of the core of the class of minimum cost spanning tree games. Thus, it appears that the generalized linear production model is a unifying model which can be used to explain the non-emptiness of the core of cooperative games generated by various, seemingly different, optimization models.This research was partially done while the author was visiting the Graduate School of Business Administration at Tel-Aviv University. The research was partially supported by Natural Sciences and Engineering Research Council Canada Grant A4181 and by SSHRC leave fellowship 451-83-0030.Dedicated to George B. Dantzig.