Content deleted Content added
Remove orphan tag - linked from n-player games and minimax |
Mention maxn's specific application for n-player games |
||
Line 1:
{{short description|A decisive algorithm that solves $n$-player general-sum games.}}
In the mathematical area of [[game theory]], the '''max<sup>n</sup>''' algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player. The algorithm was designed by Luckhardt and Irani.<ref>{{cite conference |last1=Luckhardt |first1=Carol A. |last2=Irani |first2=Keki B. |title=An Algorithmic Solution of N-Person Games |date=11 August 1986 |conference=AAAI '86 |pages=158–162 |url=https://cdn.aaai.org/AAAI/1986/AAAI86-025.pdf |access-date=20 August 2024 |archive-date=19 April 2024 |archive-url=https://web.archive.org/web/20240419091220/https://cdn.aaai.org/AAAI/1986/AAAI86-025.pdf |url-status=live }}</ref>
== See also ==
| |||