Support enumeration and search (n player games Nash Equilibria)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == Unknown == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == == Year == 2004 == Reference == https://www.aaai.org/Library/AAAI/2004/aaai04-105.php")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

Unknown

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Year

2004

Reference

https://www.aaai.org/Library/AAAI/2004/aaai04-105.php

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Support_enumeration_and_search_(n_player_games_Nash_Equilibria)&oldid=45731"