Semi-infinite assignment problems and related games

Natividad Llorca, Stef Tijs and Judith Timmer

Mathematical Methods of Operations Research, 2003, vol. 57, issue 1, 67-78

Abstract: 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. Copyright Springer-Verlag Berlin Heidelberg 2003

Keywords: Key words: Infinite programs; assignment; cooperative games; balancedness (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200245 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:57:y:2003:i:1:p:67-78

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200245

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().