Abstract
Unfortunately there is no general method for the solution of an arbitrary n-person game given in normal form. By solution we mean finding all equilibrium points of the game. The situation is not any better if we want to tackle the much less difficult problem of determining only one equilibrium point of a general n-person game. However this latter task is more amenable to analysis in case of special n-person games. Mathematical programming methods, special iterative processes and combinatorial methods have proved to be most successful for the solution of special n-person games including those such as concave games, polyhedral games, finite n- person games and the oligopoly game. Intensive research work is being done in this field and emergence of new, more efficient methods, as well as the extension of classes of games solvable by them is expected in the near future
Chapter PDF
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Akadémiai Kiadó, Budapest, Hungary
About this chapter
Cite this chapter
Szép, J., Forgó, F. (1985). Special n-person games and methods to solve them. In: Introduction to the Theory of Games. Mathematics and Its Applications, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5193-8_4
Download citation
DOI: https://doi.org/10.1007/978-94-009-5193-8_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8796-4
Online ISBN: 978-94-009-5193-8
eBook Packages: Springer Book Archive