Semi-Infinite Assignment Problems and Related Games

N. Llorca, S.H. Tijs, J.B. Timmer

Research output: Working paperDiscussion paperOther research output

406 Downloads (Pure)


In 1972 Shapley and Shubik introduced assignment games associated to finite assignment problems in which two types of agents were involved and they proved that these games have a non-empty core. In this paper we look at the situation where the set of one type is infinite and investigatewhen the core of the associated game is non-empty. Two infinite programming problems 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 non-empty. Finally, the existence of optimal assignments is discussed.
Original languageEnglish
Place of PublicationTilburg
Number of pages12
Publication statusPublished - 1999

Publication series

NameCentER Discussion Paper


  • Infinite programs
  • assignment
  • cooperative games
  • balancedness


Dive into the research topics of 'Semi-Infinite Assignment Problems and Related Games'. Together they form a unique fingerprint.

Cite this