On the Convexity of Precedence Sequencing Games
- 69 Downloads
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. We show that these sequencing games are convex if the initial order of the jobs is a concatenation of chains.
Keywordscooperative games sequencing situations
Unable to display preview. Download preview PDF.
- Curiel, I., J. Potters, V. Rajendra Prasad, S. Tijs, and B. Veltman. (1994). “Sequencing and cooperation.” Operations Research 42, 566–568.Google Scholar
- Hamers, H., P. Borm, and S. Tijs. (1995). “On Games Corresponding to Sequencing Situations with Ready Times.” Mathematical Programming 70, 1–13.Google Scholar
- Maschler, M., B. Peleg, and L. Shapley. (1972). “The Kernel and Bargaining Set of Convex Games.” International Journal of Game Theory 2, 73–93.Google Scholar
- Tijs, S. (1981). “Bounds for the Core and the τ-Value.” In O. Moeschlin and D. Pallaschke (eds.), Game Theory and Mathematical Economics,Amsterdam: North Holland Publishing Company, pp. 123–132.Google Scholar