Jump to content

Max^n algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LeoDog896 (talk | contribs) at 16:13, 20 August 2024 (Init page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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. The algorithm was designed by Luckhardt and Irani[1].

See also

References

  1. ^ Luckhardt, Carol; Irani, Keki (11 August 1986). "An Algorithmic Solution of N-Person Games" (PDF). AAAI (AAAI'86): 158–162. doi:10.5555/2887770.2887795. {{cite journal}}: Check |doi= value (help)


Stub icon

This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This game theory article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Max%5En_algorithm&oldid=1241334064"