Title of article :
How Incomputable is Finding Nash Equilibria?
Author/Authors :
Pauly, Arno University of Cambridge, United Kingdom
From page :
2686
To page :
2710
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.
Keywords :
Computable Analysis , Discontinuity , Game Theory , Nash Equilibrium , , Weihrauch , degree
Journal title :
International Journal of Universal Computer Sciences
Journal title :
International Journal of Universal Computer Sciences
Record number :
2574755
Link To Document :
بازگشت