Max^n algorithm: Difference between revisions
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: | Line 1: | ||
{{short description|A decisive algorithm that solves $n$-player general-sum games.}} |
{{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> |
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 in [[n-player game|n-player games]]. 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 == |
== See also == |
||
Revision as of 16:15, 21 August 2024
In the mathematical area of game theory, the maxn algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player in n-player games. The algorithm was designed by Luckhardt and Irani.[1]
See also
References
- ^ Luckhardt, Carol A.; Irani, Keki B. (11 August 1986). An Algorithmic Solution of N-Person Games (PDF). AAAI '86. pp. 158–162. Archived (PDF) from the original on 19 April 2024. Retrieved 20 August 2024.
 | This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it. |
 | This game theory article is a stub. You can help Wikipedia by expanding it. |