Semi-Infinite Assignment and Transportation Games
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.
KeywordsAssignment Problem Transportation Problem Demand Point Transportation Plan Cooperative Game Theory
Unable to display preview. Download preview PDF.
- F.Y. Edgeworth, Mathematical Psychics, Kegan, London, 1981.Google Scholar
- D.B. Gillies. Some theorems on N-person games. Dissertation, Princenton University, 1953.Google Scholar
- M. A. Goberna and M.A. López. LinearSemi-Infintite Optimization, Wiley, 1998.Google Scholar
- G. Owen. Garme Theory, Academic Press, 1995.Google Scholar
- J. Sánchez-Soriano, M.A. López, and I. García-Jurado. On the Core of Transportation Games, Mathematical Social Sciences, 2000.Google Scholar
- A. Schrijver. Theory of Linear and Integer Prograrmrming, Wiley, 1986.Google Scholar