Loading...
Semi-Infinite Assignment Problems and Related Games
Llorca,N. Tijs,S.H. Timmer,J.B.
Llorca,N.
Tijs,S.H.
Timmer,J.B.
Abstract
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.
Description
Pagination: 12
Date
1999
Journal Title
Journal ISSN
Volume Title
Publisher
Microeconomics
Files
Loading...
74.pdf
Adobe PDF, 122.59 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Infinite programs, assignment, cooperative games, balancedness
Citation
Llorca, N, Tijs, S H & Timmer, J B 1999 'Semi-Infinite Assignment Problems and Related Games' CentER Discussion Paper, vol. 1999-74, Microeconomics, Tilburg.