ML Anthology

An Algorithmic Solution of N-Person Games

Carol Luckhart, Keki B. Irani
AAAI 1986 pp. 158-162
/aaai/1986/luckhart1986aaai-algorithmic/

Abstract

ABSTRACT function is a function which estimates what resulting value Two-person, perfect information, constant sum games have been studied in Artificial Intelligence. This paper opens up the issue of playing n-person games and proposes a pro-cedure for constant sum or non-constant sum games. It is proved that a procedure, max”, locates an equilibrium point given the entire game tree. The minimax procedure for 2-person games using look ahead finds a saddle point of approximations, while maxn finds an equilibrium point of the values of the evaluation function for n-person games using look ahead. Maz ” is further analyzed with respect to some pruning schemes. I

PDF AAAI Semantic Scholar

Cite

Text

Luckhart and Irani. "An Algorithmic Solution of N-Person Games." AAAI Conference on Artificial Intelligence, 1986.

Markdown

[Luckhart and Irani. "An Algorithmic Solution of N-Person Games." AAAI Conference on Artificial Intelligence, 1986.](https://mlanthology.org/aaai/1986/luckhart1986aaai-algorithmic/)

BibTeX

@inproceedings{luckhart1986aaai-algorithmic,
  title     = {{An Algorithmic Solution of N-Person Games}},
  author    = {Luckhart, Carol and Irani, Keki B.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1986},
  pages     = {158-162},
  url       = {https://mlanthology.org/aaai/1986/luckhart1986aaai-algorithmic/}
}