How Incomputable is Finding Nash Equilibria?

8 years 9 months ago
How Incomputable is Finding Nash Equilibria?
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, also pure and correlated equilibria, as well as various concepts of iterated strategy elimination, are dealt with. As a side result, the Weihrauch-degree of solving systems of linear inequalities is settled. Key Words: Game Theory, Computable Analysis, Nash Equilibrium, Discontinuity, Weihrauch-degree Category: F.2.0
Arno Pauly
Added 20 May 2011
Updated 20 May 2011
Type Journal
Year 2010
Where JUCS
Authors Arno Pauly
Comments (0)