Abstract
Games with limited interaction are considered. A global behaviour of a team of players in the game is observed. The average total payoff received by the team of players is chosen as a criterion of the global behaviour. The game is implemented by a neural network of Boltzmann Machine type. The model is applied to solve an optimal task assignment problem in parallel computers. Results of experimental study of the model are presented.
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
References
Aarts EHL, Korst JHM (1989) Boltzmann machines for travelling salesman problems. Europ. J. of Oper. Research 39: 79–95
Indurkhya B, Stone HS and Xi-Cheng L (1986) Optimal partitioning of randomly generated distributed programs. IEEE Trans. on Software Eng., SE-12(3):483–495
Seredynski F (1991) Self-organization in homogeneous networks of learning automata. Proc. of the 6th Czechoslovak Annual AI Conference, Prague, June 25-27, 1991
Seredynski F (1992) Mapping by migrating Boltzmann Machine. Proc. of Parallel Problem Solving From Nature Conference, Brussels, Sept. 28-30, 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seredynski, F. (1993). Boltzmann Machine Solution N-Person Games. In: Karmann, A., Mosler, K., Schader, M., Uebe, G. (eds) Operations Research ’92. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-12629-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-662-12629-5_40
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0679-3
Online ISBN: 978-3-662-12629-5
eBook Packages: Springer Book Archive