An algorithmic solution of N-person games
作者： Keki B. Irani , Carol A. Luckhardt
DOI:
关键词:
摘要: Two-person, perfect information, constant sum games have been studied in Artificial Intelligence. This paper opens up the issue of playing n-person and proposes a procedure for or non-constant games. It is proved that procedure, maxn, locates an equilibrium point given entire game tree. The minimax 2-person using look ahead finds saddle approximations, while maxn values evaluation function ahead. Maxn further analyzed with respect to some pruning schemes.
参考文章(2)
Howard Raiffa, R. Duncan Luce, T. Teichmann, Games and decisions ,(1957)
A. J. Jones, Game theory: Mathematical models of conflict ,(1980)