| Article ID: | iaor20041107 |
| Country: | Germany |
| Volume: | 57 |
| Issue: | 1 |
| Start Page Number: | 67 |
| End Page Number: | 78 |
| Publication Date: | Jan 2003 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Tijs S., Timmer J., Llorca N. |
| Keywords: | programming: assignment |
In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising from these assignments is as large as possible. An infinite programming problem and its dual arise here, which we tackle with the aid of finite approximations. We prove that there is no duality gap and we show that the core of the corresponding game is nonempty. Finally, the existence of optimal assignments is discussed.