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. 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. There are no other restrictions whatsoever on the processing schedule. 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. The proof of this statement is constructive and provides a core element in polynomial time.
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 InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 202 (2010)
Issue (Month): 3 (May)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Scheduling Individual capacity Cooperation Core 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
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.:
- 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.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations Research Games: A Survey," Discussion Paper 2001-45, Tilburg University, Center for Economic Research.
- 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.
- 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.
- 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.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
- 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: (Zhang, Lei).
If references are entirely missing, you can add them using this form.