Efficient algorithmic methods for Nash equilibria computation

From LRDE

Revision as of 17:05, 9 January 2018 by Bot (talk | contribs) (Created page with "{{CSIReport | authors = Antoine Leblanc | title = Efficient algorithmic methods for Nash equilibria computation | year = 2007 | abstract = One of the remaining problems with N...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Abstract

One of the remaining problems with Nash equilibria is the lack of efficiency of best known algorithms. In general case their worst complexity is . Those algorithms are usually old, and aren't likely to be improved. This study focuses first on main algorithms and methods and explains their advantages and their weaknesses. It then introduces a new algorithm developed at the LRDE based on a geometrical approach: a TOP computing method in dimensions.