This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borm, P., G. Fiestras-Janeiro, H. Hamers, E. Sánchez E., and M. Voorneveld (1999): “On the convexity of games corresponding to sequencing situations with due dates,” CentER Discussion Paper 1999–49. To appear in: European Journal of Operational Research.
Calleja, P., P. Borm, H. Hamers, F. Klijn, and M. Slikker (2001): “On a new class of parallel sequencing situations and related games,” CentER Discussion Paper 2001–3.
Curiel, I. (1997): Cooperative game theory and applications. Dordrecht: Kluwer Acacemic Publishers.
Curiel, I., G. Pederzoli, and S. Tijs (1989): “Sequencing games,” European Journal of Operational Research, 40, 344–351.
Curiel, I., J. Potters, V. Rajendra Prasad, S. Tijs, and B. Veltman (1993): “Cooperation in one machine scheduling,” Methods of Operations Research, 38, 113–131.
Curiel, I., J. Potters, V. Rajendra Prasad, S. Tijs, and B. Veltman (1994): “Sequencing and cooperation,” Operations Research, 42, 566–568
Curiel, I., and S. Tijs (1986): “Assignment games and permutation games,” Methods of Operations Research, 54, 323–334.
Gale, D. (1984): “Equilibrium in a discrete exchange economy with money,” International Journal of Game Theory, 13, 61–64.
Granot, D., H. Hamers, and S. Tijs (1999): “On some balanced, totally balanced and submodular delivery games,” Mathematical Programming, 86, 355–366.
Granot, D., and G. Huberman (1981): “Minimum cost spanning tree games,” Mathematical Programming, 21, 1–18.
Hamers, H., P. Borm, and S. Tijs (1995): “On games corresponding to sequencing situations with ready times,” Mathematical Programming, 70, 1–13.
Hamers, H., F. Klijn, and J. Suijs (1999): “On the balancedness of multimachine sequencing games,” European Journal of Operational Research 119, 678–691.
Hamers, H., J. Suijs, S. Tijs, and P. Borm (1996): “The split core for sequencing games,” Games and Economic Behavior, 15, 165–176.
Ichiishi, T. (1981): “Super-modularity: applications to convex games and the greedy algorithm for LP,” Journal of Economic Theory, 25, 283–286.
Klijn, F., S. Tijs, and H. Hamers (2000): “Balancedness of permutation games and envy-free allocations in indivisible good economies, Economics Letters, 69, 323–326.
Maschler, M., B. Peleg, and L. Shapley (1972): “The kernel and bargaining set of convex games,” International Journal of Game Theory, 2, 73–93.
Owen, G. (1975): “On the core of linear production games,” Mathematical Programming, 9, 358–370.
Potters, J., I. Curiel, and S. Tijs (1992): “Traveling Salesman Games,” Mathematical Programming, 53, 199–211.
Potters, J., and H. Reijnierse (1995): “Γ-component additive games,” International Journal of Game Theory, 24, 49–56.
Shapley, L. (1971): “Cores of convex games,” International Journal of Game Theory, 1, 11–26.
Shapley, L., and M. Shubik (1972): “The assignment game I: The core,” International Journal of Game Theory, 1, 111–130.
Smith, W. (1956): “Various optimizers for single-stage production,” Naval Research Logistics Quarterly, 3, 59–66.
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, 123–132.
Tijs, S. (1991): “LP-games and combinatorial optimization games,” Cahiers du Centre d’Etudes de Recherche Operationnelle, 34, 167–186.
Tijs, S., T. Parthasarathy, J. Potters, and V. Rajendra Prasad (1984): “Permutation games: another class of totally balanced games,” OR Spektrum, 6, 119–123.
van den Nouweland, A., M. Krabbenborg, and J. Potters (1992): “Flowshops with a dominant machine,” European Journal of Operational Research 62, 38–46.
van Velzen, B., and H. Hamers (2001): “Relaxations on sequencing games,” Working paper Tilburg University.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Curiel, I., Hamers, H., Klijn, F. (2002). Sequencing Games: a Survey. In: Borm, P., Peters, H. (eds) Chapters in Game Theory. Theory and Decision Library C:, vol 31. Springer, Boston, MA. https://doi.org/10.1007/0-306-47526-X_2
Download citation
DOI: https://doi.org/10.1007/0-306-47526-X_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7063-1
Online ISBN: 978-0-306-47526-9
eBook Packages: Springer Book Archive