Semi-Infinite Assignment and Transportation Games

Abstract

Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An assignment situation is a special kind of transportation situation where the supplies and demands for the good all equal one unit. It is shown that the special structure of these situations implies that the underlying infinite programs have no duality gap and that the core of the corresponding game is nonempty.

Keywords: cooperative games, transportation situations, assignment situations, duality gap, core.

JEL Classification: C71, C61