Sequencing games with repeated players

This file is part of IDEAS, which uses RePEc data

Sequencing games with repeated players

Author Info

Estevez-Fernandez,
Borm, P.E.M.
Calleja, P.
Hamers, H.J.M. (Tilburg University, Center for Economic Research)

Additional information is available for the following registered author(s):

Abstract

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations. In max-RP sequencing situations it is assumed that each player's cost function is linear with respect to the maximum completion time of his jobs, whereas in min-RP sequencing situations the cost functions are linear with respect to the minimum completion times. For both classes, following explicit procedures to go from the initial processing order to an optimal order for the coalition of all players, equal gain splitting rules are defined. It is shown that these rules lead to core elements of the associated RP sequencing games. Moreover, it is seen that min-RP sequencing games are convex.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 128.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2004
Date of revision:
Handle: RePEc:dgr:kubcen:2004128

Contact details of provider:
Web page: http://center.uvt.nl

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords:

Find related papers by JEL classification:
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

This paper has been announced in the following NEP Reports:

NEP-ALL-2005-01-02 (All new papers)
NEP-GTH-2005-01-02 (Game Theory)

References listed on IDEAS
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.:

Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December. [Downloadable!] (restricted)
Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June. [Downloadable!] (restricted)
Calleja, P. & Estevez-Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2004. "Job scheduling, cooperation, and control," Discussion Paper 65, Tilburg University, Center for Economic Research. [Downloadable!]

Full references

Cited by:
(explanations, 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, Arantza & Mosquera, Manuel A. & Borm, Peter & Hamers, Herbert, 2006. "Proportionate flow shop games," Discussion Paper 63, Tilburg University, Center for Economic Research. [Downloadable!]

Statistics

Access and download statistics

Did you know? IDEAS was launched in September 1997.

This page was last updated on 2009-12-21.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.