Processing Games with Shared Interest
AbstractA generalization of processing problems with restricted capacities is introduced.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.The new aspect is that players have interest in all jobs. The corresponding cooperative game of this generalization is proved to be totally balanced.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2004-126.
Date of creation: 2004
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Processing games; scheduling; core allocation;
Other versions of this item:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Estevez Fernandez, M.A. & Borm, P.E.M. & Calleja, P. & Hamers, H.J.M., 2008.
"Sequencing games with repeated players,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-195639, Tilburg University.
- Meertens, M. & Borm, P.E.M. & Reijnierse, J.H. & Quant, M., 2004.
"Processing Games with Restricted Capacities,"
2004-83, Tilburg University, Center for Economic Research.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.