Processing Games with Restricted Capacities
AbstractThis paper analyzes processing problems and related cooperative games.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.There are no restrictions whatsoever on the processing schedule.The main feature of the model is a capacity restriction, i.e., there is a maximum amount of effort per time unit available for handling jobs.Assigning to each job a player and letting each player have an individual capacity for handling jobs, each coalition of cooperating players in fact faces a processing problem with the coalitional capacity being the sum of the individual capacities of the members.The corresponding processing game summarizes the minimal joint costs for every coalition.It turns out that processing games are totally balanced.An explicit core element is constructed.
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-83.
Date of creation: 2004
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
games; capacity; scheduling; cooperation; allocation;
Other versions of this item:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2004-10-21 (All new papers)
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.:
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001.
"Operations research games: A survey,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-305110, Tilburg University.
- Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 9(2), pages 139-199, December.
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, Tilburg University.
- Legut, J. & Potters, J.A.M. & Tijs, S.H., 1994. "Economies with land: A game theoretical approach," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154193, Tilburg University.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
- Legut J. & Potters J. A. M. & Tijs S. H., 1994. "Economies with Land--A Game Theoretical Approach," Games and Economic Behavior, Elsevier, vol. 6(3), pages 416-430, May.
- Quant, M. & Meertens, M. & Reijnierse, J.H., 2004.
"Processing Games with Shared Interest,"
2004-126, 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.